Abstract
We prove that semigroups generated by reversible two-state Mealy automata have remarkable growth properties: they are either finite or free. We give an effective procedure to decide finiteness or freeness of such semigroups when the generating automaton is also invertible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have