Varieties generated by certain models of reversible finite automataReport as inadecuate




Varieties generated by certain models of reversible finite automata - Download this document for free, or read online. Document in PDF available to download.

1 Institute of Mathematics and Computer Science, University of Latvia 2 LIAFA - Laboratoire d-informatique Algorithmique : Fondements et Applications

Abstract : 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.

keyword : Quantum automaton Reversible automaton regular language finite monoid





Author: Marats Golovkins - Jean-Eric Pin -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents