Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups

DOI10.4230/LIPICS.MFCS.2016.44zbMath1398.68309arXiv1604.03270MaRDI QIDQ4608606

Thibault Godin, Ines Klimann

Publication date: 21 March 2018

Full work available at URL: https://arxiv.org/abs/1604.03270

zbMATH Keywords

reversibilityautomaton groupsBurnside problemorbit trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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 (5)

On groups generated by bi-reversible automata: the two-state case over a changing alphabet ⋮ On bireversible Mealy automata and the Burnside problem ⋮ An automaton group with undecidable order and Engel problems ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries

This page was built for publication: Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups