Publisher
Springer International Publishing
Reference27 articles.
1. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS’98, pp. 332–341. IEEE (1998)
2. Ambainis, A.: The complexity of probabilistic versus deterministic finite automata. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 233–238. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0009499
3. Ambainis, A., Yakaryılmaz, A.: Superiority of exact quantum automata for promise problems. Inf. Process. Lett. 112(7), 289–291 (2012)
4. Ambainis, A., Yakaryılmaz, A.: Automata and quantum computing. In: Éric Pin, J. (ed.) Handbook of Automata Theory, vol. 2, chap. 39, pp. 1457–1493. European Mathematical Society Publishing House (2021)
5. Belovs, A., Montoya, J.A., Yakaryılmaz, A.: On a conjecture by Christian Choffrut. Int. J. Found. Comput. Sci. 28(5), 483–502 (2017)