Varieties generated by certain models of reversible finite automata

Authors:
Marats Golovkins;Jean-Eric Pin
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Riga, Latvia;LIAFA, Université Paris VII and CNRS, Paris, France
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 13
Cited 2

On the languages accepted by finite reversible automata

14th International Colloquium on Automata, languages and programming
Quantum automata and quantum grammars

Theoretical Computer Science
Varieties Of Formal Languages

Varieties Of Formal Languages
Dense quantum coding and quantum finite automata

Journal of the ACM (JACM)
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
Syntactic Semiring of a Language

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Reversible Automata

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Probabilistic Reversible Automata and Quantum Automata

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum computing: 1-way quantum automata

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Probabilities to accept languages by quantum finite automata

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Lower Bounds for Generalized Quantum Finite Automata

Language and Automata Theory and Applications
On varieties of meet automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.