Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference53 articles.
1. 1-way quantum finite automata: strengths, weaknesses, and generalizations;Ambainis,1998
2. Improved constructions of quantum automata;Ambainis;Theor. Comput. Sci.,2009
3. Superiority of exact quantum automata for promise problems;Ambainis;Inf. Process. Lett.,2012
4. On complexity of regular languages in terms of finite automata;Berman,1977
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献