A geometric approach to (semi)-groups defined by automata via dual transducers

Abstract

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 of Cayley type of machines. Lastly, we address the problem of the study of the action of these groups in the boundary. We show that examples of groups having essentially free actions without critical points lie in the class of groups defined by the transducers whose enriched dual generate a torsion-free semigroup. Finally, we provide necessary and sufficient conditions to have finite Schreier graphs on the boundary yielding to the decidability of the algorithmic problem of checking the existence of Schreier graphs on the boundary whose cardinalities are upper bounded by some fixed integer.

References in corpus (3)

• Implementing Computations in Automaton (Semi)groups
• On the Finiteness Problem for Automaton (Semi)groups
• Groups and Semigroups Defined by Colorings of Synchronizing Automata

Cited by in corpus (4)

• On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups
• Automaton Semigroups and Groups: On the Undecidability of Problems Related to Freeness and Finiteness
• Infinite Automaton Semigroups and Groups Have Infinite Orbits
• On a class of poly-context-free groups generated by automata