2000 character limit reached
Generic properties in some classes of automaton groups
Published 27 Mar 2019 in cs.FL, cs.DM, and math.GR | (1903.11315v1)
Abstract: We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
