Efficient probability amplification in two-way quantum finite automata-Reference-Cited by-同舟云学术

Efficient probability amplification in two-way quantum finite automata

Published:2009-05 Issue:20 Volume:410 Page:1932-1941
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Yakaryılmaz Abuzer,Say A.C. Cem

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. On the class of languages recognizable by 1-way quantum finite automata;Ambainis,2001

2. A. Ambainis, R. Freivalds, 1-way quantum finite automata: Strengths, weaknesses and generalizations, in: FOCS’98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, California, 1998

3. Two-way finite automata with quantum and classical states;Ambainis;Theoretical Computer Science,2002

4. F.M. Atak, Design and simulation of two-way quantum finite automata, Master’s thesis, Boğaziçi University, İstanbul, Turkey, 2006

5. Regular languages accepted by quantum automata;Bertoni;Information and Computation,2001

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Pushdown Automata with Garbage Tape;International Journal of Foundations of Computer Science;2018-04

2. New Results on the Minimum Amount of Useful Space;International Journal of Foundations of Computer Science;2016-02

3. Quantum Pushdown Automata with a Garbage Tape;Lecture Notes in Computer Science;2015

4. The Minimum Amount of Useful Space: New Results and New Directions;Developments in Language Theory;2014

5. Superiority of one-way and realtime quantum machines;RAIRO - Theoretical Informatics and Applications;2012-10