Publisher
Springer International Publishing
Reference22 articles.
1. Adámek, J., Milius, S., Myers, R., Urbat, H.: Generalized Eilenberg theorem: varieties of languages in a category. ACM Trans. Comput. Log. 20(1), 3:1–3:47 (2019)
2. Ambainis, A., Yakaryılmaz, A.: Automata and quantum computing (2018). https://arxiv.org/abs/1507.01988
3. Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 93–104. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24749-4_9
4. Ambainis1, A., Ķikusts, A., Valdats, M.: On the class of languages recognizable by 1-way quantum finite automata. In: Ferreira, A. Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 75–86. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44693-1_7
5. Lecture Notes in Computer Science;M Bojańczyk,2015
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献