1. Inference of reversible languages;Angluin;J. ACM,1982
2. A. Ambainis, R. Freivalds, One-way quantum finite automata: Strengths, weaknesses and generalizations, in: Proc. 39th Annu. Symp. Foundations of Computer Science, Palo Alfo, California, 1998, pp. 332–341. Also quant-ph/9802062, 1998
3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani, Dense quantum coding and a lower bound for 1-way quantum automata, in: Proc. 31st Annu. ACM Symp. Theory of Computing, Atlanta, Georgia, 1999, pp. 376–383. Also quant-ph/9804043, 1998
4. Two-way finite automata with quantum and classical states;Ambainis;Theoret. Comput. Sci.,2002
5. Introduction to the Theory of Automata;Bavel,1983