Emergent Mind
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
(1208.6324)
Published Aug 30, 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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.