On groups of reversible automata

From MaRDI portal





The paper constructs, for an arbitrary nontrivial finite group \(X\), a reversible automaton \(A_X\) whose state set and alphabet both coincide with \(X\) and whose transition and output functions are defined via the left regular action of \(X\). The associated automaton arises from an oriented square complex \(\Delta_X\), which is shown to be non-complete; consequently, \(A_X\) is reversible but not bireversible. The paper studies the automaton group \(G_X\) generated by \(A_X\).\N\NOne of the main results establishes that \(G_X\) acts level transitively on the rooted tree \(X^*\). The group admits a structural decomposition: it splits as a semidirect product of a subgroup generated by infinitely many copies of \(X\) indexed over \(\mathbb{Z}\) with an infinite cyclic group generated by a distinguished element. A further result shows that \(G_X\) contains a lamplighter subgroup of the form \(A \wr \mathbb{Z}\), where \(A\) is the center of \(X\).











This page was built for publication: On groups of reversible automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846831)