1. Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. Theory Comput. Syst. 39(1), 165–188 (2006)
2. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pp. 332–341. IEEE (1998)
3. Lecture Notes in Computer Science;L Anticoli,2016
4. Arrighi, P.: An overview of quantum cellular automata. Nat. Comput. 18(4), 885–899 (2019)
5. Bell, P.C., Hirvensalo, M.: Acceptance ambiguity for quantum automata. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)