Varieties generated by certain models of reversible finite automata

Marats Golovkins (1) , Jean-Eric Pin (2)

1 LU - University of Latvia
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.

Mots clés: Quantum automaton; Reversible automaton; regular language; finite monoid

Domaines: Autre [cs.OH]; Théorie des groupes [math.GR]; Mathématique discrète [cs.DM]

Marats Golovkins, Jean-Eric Pin. Varieties generated by certain models of reversible finite automata. 2006, pp.83-93. ⟨hal-00112855⟩