Subject
Computer Science Applications,General Mathematics,Software
Reference49 articles.
1. A. Ambainis and R. Freivalds, 1-way quantum finite automata : strengths, weaknesses and generalizations, inProc. of 39th Annual Symposium on Foundations of Computer Science, FOCS’98(1998) 332–341.
2. Ambainis A. and Watrous J., Two-way finite automata with quantum and classical states.Theoret. Comput. Sci.287(2002) 299–311.
3. Ambainis A. and Yakaryılmaz A., Superiority of exact quantum automata for promise problems.Inf. Process. Lett.112(2012) 289–291.
4. A. Ambainis and A. Yakaryılmaz, Automata : from Mathematics to Applications, inAutomataand quantum computing, in preparation.
5. Ambainis A., Nayak A., Ta-Shma A. and Vazirani U., Dense quantum coding and quantum finite automata.J. ACM49(2002) 496–511.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exact Affine Counter Automata;International Journal of Foundations of Computer Science;2022-04
2. New Results on Vector and Homing Vector Automata;International Journal of Foundations of Computer Science;2019-12
3. Quantum ω-Automata over Infinite Words and Their Relationships;International Journal of Theoretical Physics;2019-01-12
4. Quantum Pushdown Automata with Garbage Tape;International Journal of Foundations of Computer Science;2018-04
5. Uncountable classical and quantum complexity classes;RAIRO - Theoretical Informatics and Applications;2018-04