Related papers: The growth rates of automaton groups generated by …
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 reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…
We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.
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 paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We prove that the boundary dynamics of the (semi)group generated by the enriched dual transducer characterizes the algebraic property of being free for an automaton group. We specialize this result to the class of bireversible transducers…
We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, 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 give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…
We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…
Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is…
This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise…
We prove that if the group generated by a Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth…
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…
The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…
We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…
We adapt Safin's result on powers of sets in free groups to obtain Helfgott type growth in free products: if A is any finite subset of a free product of two arbitrary groups then either A is conjugate into one of the factors, or the size of…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…