The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable.

Ines Klimann

Browse the full STACS paper archive.