The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable - Université Paris Cité Access content directly
Conference Papers Leibniz International Proceedings in Informatics Year : 2013

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

Ines Klimann
  • Function : Author
  • PersonId : 947208

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.
Fichier principal
Vignette du fichier
stacs010.klimann.pdf (237.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00875177 , version 1 (21-10-2013)

Identifiers

Cite

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⟩
154 View
167 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More