Related papers: Cayley automaton semigroups
In this note we prove that, for a finite semigroup $S$, the dual Cayley automaton semigroup $\mathbf{C^{\ast}}(S)$ is finite if and only if $S$ is $\mathcal{H}$-trivial and has no non-trivial right zero subsemigroups.
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special…
In this paper, we give an introduction to basic concepts of automaton semigroups. While we must note that this paper does not contain new results, it is focused on extended introduction in the subject and detailed examples.
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
In this paper we introduce a way to estimate a level of closeness of Cayley automatic groups to the class of automatic groups using a certain numerical characteristic. We characterize Cayley automatic groups which are not automatic in terms…
We prove that the semigroup generated by a reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
A linear algebraic group G over a field k is called a Cayley group if it admits a Cayley map, i.e. a G-equivariant birational isomorphism over k between the group variety G and its Lie algebra Lie(G). A prototypical example is the classical…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…