To Infinity and Beyond

2017/08/21 by Klimann, Ines
#FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1708.06173

Abstract

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton.

Related

• Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• Infinite finitely generated automata semigroups have infinite orbits
• The growth rates of automaton groups generated by reset automata
• Bireversible automata generating lamplighter groups