@InProceedings{klimann:LIPIcs.STACS.2013.502,
  author =	{Klimann, Ines},
  title =	{{The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{502--513},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Portier, Natacha and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.502},
  URN =		{urn:nbn:de:0030-drops-39605},
  doi =		{10.4230/LIPIcs.STACS.2013.502},
  annote =	{Keywords: Mealy automata, automaton semigroups, decidability of finiteness, decidability of freeness, Nerode equivalence}
}