On the Finiteness Problem for Automaton (Semi)Groups

@article{Akhavi2012OnTF,
  title={On the Finiteness Problem for Automaton (Semi)Groups},
  author={Ali Akhavi and Ines Klimann and S. Lombardy and J. Mairesse and Matthieu Picantin},
  journal={ArXiv},
  year={2012},
  volume={abs/1105.4725}
}
  • Ali Akhavi, Ines Klimann, +2 authors Matthieu Picantin
  • Published 2012
  • Mathematics, Computer Science
  • ArXiv
  • This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for finiteness and, for groups, an effective necessary but not sufficient condition. The efficiency of the new criteria is demonstrated by testing all Mealy automata with small stateset and alphabet. Finally, for groups, we provide a necessary and sufficient… CONTINUE READING
    45 Citations

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    A Characterization of Those Automata That Structurally Generate Finite Groups
    • 4
    • PDF
    Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups
    • 6
    • PDF
    On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
    • 22
    • PDF
    The Finiteness Problem for Automaton Semigroups is Undecidable
    • 39
    • PDF
    Implementing Computations in Automaton (Semi)groups
    • 14
    On bireversible Mealy automata and the Burnside problem
    • 2
    The growth rates of automaton groups generated by reset automata
    • 10
    • PDF

    References

    SHOWING 1-10 OF 47 REFERENCES
    Automata and Square Complexes
    • 62
    • PDF
    On a Class of Automata Groups Generalizing Lamplighter Groups
    • 72
    • PDF
    Groups and Semigroups Defined by some Classes of Mealy Automata
    • 3
    • PDF
    Groups defined by automata
    • 19
    • PDF
    Automaton semigroups
    • A. Cain
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2009
    • 32
    • PDF
    Automata over a Binary Alphabet Generating Free Groups of Even Rank
    • 34
    • PDF
    Classification of groups generated by 3-state automata over a 2-letter alphabet
    • 40
    • PDF