Ines Klimann. The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable.
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Feb 2013, Kiel, Germany. pp.502--513,
⟨10.4230/LIPIcs.STACS.2013.502⟩.
⟨hal-00875177⟩