Related papers: Bireversible automata generating lamplighter group…

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…

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 study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

We are following [4]. Nevertheless we are interested only in claryfication that the lamplighter group can be realized as a 2--states Mealy machine.

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 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…

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

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…

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…

We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.

We consider word automaticity for groups that are nilpotent of class $2$ and have exponent a prime $p$. We show that the infinitely generated free group in this variety is not word automatic. In contrast, the infinite extra-special…

In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that…

We show that every bounded automaton group can be embedded in a finitely generated, simple amenable group. The proof is based on the study of the topological full groups associated to the Schreier dynamical system of the mother groups. We…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We introduce two series of finite automata starting from the so-called Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian group while each automaton in the second series defines the…

For any finite group $A$ and any finitely generated group $B$, we prove that the corresponding lamplighter group $A\wr B$ admits a standard generating set with unbounded depth, and that if $B$ is abelian then the above is true for every…

Birman-Lubotzky-McCarthy proved that any abelian subgroup of the mapping class groups for orientable surfaces is finitely generated. We apply Birman-Lubotzky-McCarthy's arguments to the mapping class groups for non-orientable surfaces. We…

We prove that any finitely generated torsion free solvable subgroup of the group ${\rm IET}$ of all Interval Exchange Transformations is virtually abelian. In contrast, the lamplighter groups $A\wr \mathbb{Z}^k$ embed in ${\rm IET}$ for…