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
One-way probabilistic reversible and quantum one-counter automata
Theoretical Computer Science
One-Way Probabilistic Reversible and Quantum One-Counter Automata
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Quantum versus Deterministic Counter Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Quantum versus Probabilistic One-Way Finite Automata with Counter
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Quantum versus deterministic counter automata
Theoretical Computer Science
Quantum computation with write-only memory
Natural Computing: an international journal
| Hi-index | 0.00 |
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. The well-formedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. That allows specify rules for constructing such automata more naturally and simpler than in general case. Possible models of language recognition by QF1CA are considered. The recognition of some languages by QF1CA is shown and compared with recognition by probabilistic counterparts.