Implementing Computations in Automaton (Semi)groups

Abstract

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order of finite automaton (semi)groups.

12 pages, 4 figures, 3 tables, CIAA 2012

References in corpus (1)

• Implementing Computations in Automaton (Semi)groups

Cited by in corpus (10)

• The finiteness problem for automaton semigroups is undecidable
• Implementing Computations in Automaton (Semi)groups
• On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups
• A geometric approach to (semi)-groups defined by automata via dual transducers
• Automaton Semigroups and Groups: On the Undecidability of Problems Related to Freeness and Finiteness
• The growth rates of automaton groups generated by reset automata
• On the Structure Theory of Partial Automaton Semigroups
• Algorithmic decidability of Engel's property for automaton groups
• Infinite Automaton Semigroups and Groups Have Infinite Orbits
• Automorphisms of shift spaces and the Higman--Thompson groups: the one-sided case