On a class of languages recognizable by probabilistic reversible decide-and-halt automata

Authors:
Marats Golovkins;Maksim Kravtsev;Vasilijs Kravcevs
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Raia bulv. 29, Riga, Latvia;Institute of Mathematics and Computer Science, University of Latvia, Raia bulv. 29, Riga, Latvia;Institute of Mathematics and Computer Science, University of Latvia, Raia bulv. 29, Riga, Latvia
Venue:
Theoretical Computer Science
Year:
2009

Citing 6
Cited 1

Quantum automata and quantum grammars

Theoretical Computer Science
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
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
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

Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DH-PRA by proving that two ''forbidden'' constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown class is identical to a class known to be not recognizable by 1-way quantum automata. We also prove that the class of languages recognizable by DH-PRA is not closed under union and other non-trivial Boolean operations.