Characterizations of 1-way quantum finite automata

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1456-1478

  Brodsky, Alex ^a   Pippenger, Nicholas ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Automata theory; Quantum computation; Quantum finite automata

Indexed keywords

COMPUTER SCIENCE; FORMAL LANGUAGES; POLYNOMIALS; PROBABILISTIC LOGICS; QUANTUM THEORY;

QUANTUM FINITE AUTOMATA;

FINITE AUTOMATA;

EID: 0036588754     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799353443     Document Type: Article

References (20)

1. M. Amano and K. Iwama, Undecideability of quantum finite automata, in Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 368-375.
2. A. Ambainis, R. Bonner, R. Freivalds, and A. Kikusts, Probabilities to accept languages by quantum finite automata, in Computation and Combinatorics, Lecture Notes in Comput. Sci. 1627, Springer, New York, 1999.
3. A. Ambainis and R. Freivalds, 1-way quantum finite automata: Strengths, weaknesses and generalizations, in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, November 1998, IEEE Computer Society, pp. 332-342.
4. A. Ambainis, A. Ķikusts, and M. Valdats, On the class of languages recognizable by 1-way quantum finite automata, Lecture Notes in Comput. Sci. 2010, Springer, New York, 2001, pp. 75-86.
5. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani, Dense quantum coding and a lower bound for 1-way quantum automata, in Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 376-383.
6. E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM J. Comput, 26 (1997), pp. 1411-1473.
7. S. Eilenberg, Automata, Languages and Machines, Vol. B, Academic Press, New York, 1976.
8. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
9. A. Kondacs and J. Watrous, On the power of quantum finite state automata, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer Society, pp. 66-75.
10. R. Lipton and Y. Zalcstein, Word problem solvable in logspace, J. ACM, 24 (1977), pp. 523-526.
11. A. Meyer and C. Thompson, Remarks on algebraic decomposition of automata, Math. Systems Theory, 3 (1969), pp. 110-118.
12. C. Moore and J. Crutchfield, Quantum automata and quantum grammars, Theoret. Comput. Sci., 237 (2000), pp. 275-306.
13. A. Nayak, Optimal lower bounds for quantum automata and random access codes, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, IEEE Computer Society.
14. J. Ortega, Matrix Theory, Plenum Press, New York, 1987.
15. A. Paz, Introduction to Probabilistic Automata, Academic Press, New York, 1971.
16. D. Perrin, Finite automata, in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed., Elsevier Science, 1994, Chap. 1.
17. J. Pin, On languages accepted by finite reversible automata, in Proceedings of the 14th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 267, Springer, New York, 1987, pp. 237-249.
18. M. Rabin, Probabilistic automata, Inform. and Control (Shenyang), 6 (1963), pp. 230-245.
19. I. Simon, Piecewise testable events, in Proceedings of the 2nd GI Conference, Lecture Notes in Comput. Sci. 33, Springer, New York, 1975.
20. S. Wagon, The Banach-Tarski Paradox, Cambridge University Press, New York, 1985.