2000 character limit reached
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable (1208.6324v2)
Published 30 Aug 2012 in cs.FL and math.GR
Abstract: We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-state invertible-reversible Mealy automata.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.