1. A. Ambainis and R. Freivalds, ‘‘1-way quantum finite automata: Strengths, weaknesses and generalizations,’’ in Proceedings of the Annual Symposium on Foundations of Computer Science, FOCS’98 (IEEE, 1998), pp. 332–341.
2. A. Ambainis, M. Beaudry, M. Golovkins, A. Ķikusts, M. Mercer, and D. Thérien, ‘‘Algebraic results on quantum automata,’’ Theory Comput. Syst. 39, 165–188 (2006).
3. A. Ambainis, A. Ķikusts, and M. Valdats, ‘‘On the class of languages recognizable by 1-way quantum finite automata,’’ in Proceedings of the STACS 2001 18th Annual Symposium on Theoretical Aspects of Computer Science (2001), pp. 75–86.
4. Lect. Notes Comput. Sci.;A. Ambainis,1999
5. A. Ambainis and A. Yakaryılmaz, ‘‘Automata and quantum computing,’’ arXiv: 1507.01988 (2015).