1. Ambainis A., Nayak A., Ta-Shma A. and Vazirani U., Dense quantum coding and quantum automata.J. ACM49(2002) 496–511.
2. Ambainis A., The complexity of probabilistic versus deterministic finite automata,Proc. of the International Symposium on Algorithms and Computation (ISAAC96).Lect. Notes Comput. Sci.1178(1996) 233–239.
3. Ambainis A. and Watrous J., Two-way finite automata with quantum and classical states.Theoret. Comput. Sci.287(2002) 299–311.
4. A. Ambainis and R. Freivalds, One-way quantum finite automata: strengths, weaknesses and generalizations, in:Proc. of the 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Palo Alfo, California, USA (1998) 332–341.
5. Ambainis A. and Nahimovs N., Improved constructions of quantum automata.Theoret. Comput. Sci.410(2009) 1916–1922.