On bireversible Mealy automata and the Burnside problem

DOI10.1016/j.tcs.2017.10.005zbMath1405.68196OpenAlexW2762430665MaRDI QIDQ1685959

Ines Klimann, Thibault Godin

Publication date: 20 December 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.005

zbMATH Keywords

reversibilityautomaton groupsBurnside problemSchreier tries

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

To Infinity and Beyond ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ A New Hierarchy for Automaton Semigroups

Cites Work

• On Burnside's problem on periodic groups
• A geometric approach to (semi)-groups defined by automata via dual transducers.
• Ergodic decomposition of group actions on rooted trees
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• Implementing Computations in Automaton (Semi)groups
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item