Quantum automata and quantum grammars
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Quantum computation and quantum information
Quantum computation and quantum information
Varieties Of Formal Languages
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Lower Bounds for Generalized Quantum Finite Automata
Language and Automata Theory and Applications
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Theoretical Computer Science
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
The capacity of hybrid quantum memory
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak's enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characterization of R1 languages recognized by all these models. We also find that "forbidden constructions" known so far do not include all of the languages that cannot be recognized by measure-many QFA.