Author:
Qiu Daowen,Li Lvzhou,Zou Xiangfu,Mateus Paulo,Gruska Jozef
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference36 articles.
1. Amano, M., Iwama, K.: Undecidability on quantum finite automata. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 368–375. Atlanta, Georgia, USA (1999)
2. Ambainis, A., Freivalds, R.: One-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 332–341. IEEE Computer Society Press, Palo Alfo, California, USA. Also quant-ph/9802062 (1998)
3. Basu S., Pollack R., Roy M.-F.: Algorithms in Real Algebraic Geometry, 2nd Edn. Springer, New York (2006)
4. Belovs, A., Rosmanis, A., Smotrovs, J.: Multi-letter reversible and quantum finite automata. In: Proceedings of the 13th International Conference on Developments in Language Theory (DLT’2007). Lecture Notes in Computer Science, vol. 4588, pp. 60–71. Springer, Berlin (2007)
5. Bertoni, A., Mereghetti, C., Palano, B.: Quantum computing: 1-way quantum automata. In: Proceedings of the 9th International Conference on Developments in Language Theory (DLT’2003). Lecture Notes in Computer Science, vol. 2710, pp. 1–20. Springer, Berlin (2003)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献