SIAM Journal on Computing
Dense quantum coding and a lower bound for 1-way quantum automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Descriptional complexity issues in quantum computing
Journal of Automata, Languages and Combinatorics
Quantum automata and quantum grammars
Theoretical Computer Science
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
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
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Upper Bounds on the Size of One-Way Quantum Finite Automata
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Probabilistic Reversible Automata and Quantum Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Lower Bounds for Generalized Quantum Finite Automata
Language and Automata Theory and Applications
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Improved Constructions of Quantum Automata
Theory of Quantum Computation, Communication, and Cryptography
Postselection finite quantum automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
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
Journal of Computer and System Sciences
Quantum automata theory – a review
Algebraic Foundations in Computer Science
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.