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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Golovkins, M., & Pin, J. E. (2006). Varieties generated by certain models of reversible finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 83–93). Springer Verlag. https://doi.org/10.1007/11809678_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
