A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group

DOI10.1142/S0129054118400087zbMath1387.68169OpenAlexW2950124670MaRDI QIDQ4640042

Matthieu Picantin, Dmytro Savchuk, Ines Klimann

Publication date: 15 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118400087

zbMATH Keywords

Burnside groupsautomaton groupsreversible Mealy automata

Mathematics Subject Classification ID

Periodic groups; locally finite groups (20F50) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

On the existence of free subsemigroups in reversible automata semigroups

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata generating free products of groups of order 2.
• Orbit automata as a new tool to attack the order problem in automaton groups
• On the Burnside problem for periodic groups
• On Burnside's problem on periodic groups
• On bireversible Mealy automata and the Burnside problem
• Groups defined by automata
• A geometric approach to (semi)-groups defined by automata via dual transducers.
• Freeness of automaton groups vs boundary dynamics
• Ergodic decomposition of group actions on rooted trees
• ON THE WORD AND PERIOD GROWTH OF SOME GROUPS OF TREE AUTOMORPHISMS
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• Implementing Computations in Automaton (Semi)groups
• Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
• Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
• CONJUGATION IN TREE AUTOMORPHISM GROUPS
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE