Abstract
This paper focuses on quantum analogues of various models of counter automata, and almost completely proves the relation between the classes of languages recognizable by bounded error quantum ones and classical deterministic ones in every model of counter automata. It is proved that (i) under some practically reasonable assumption, quantum ones are strictly stronger than deterministic ones in two-way one-counter automata, and (ii) for any fixed k, quantum ones and deterministic ones are incomparable in one-way k-counter automata.
Cite
CITATION STYLE
Yamasaki, T., Kobayashi, H., & Imai, H. (2002). Quantum versus deterministic counter Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 584–594). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
