Quantum Pushdown Automata with a Garbage Tape-Reference-Cited by-同舟云学术

Quantum Pushdown Automata with a Garbage Tape

Published:2015 Issue: Volume: Page:352-363
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Nakanishi Masaki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46078-8_29

Reference30 articles.

1. Lecture Notes in Computer Science;F. Ablayev,2014

2. Amarilli, A., Jeanmougin, M.: A proof of the pumping lemma for context-free languages through pushdown automata, coRR, abs/1207.2819 (2012)

3. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weakness and generalizations. In: Proceedings of the 29th Symposium on Foundations of Computer Science (FOCS 1998), pp. 332–341 (1998)

4. Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theoretical Computer Science 287(1), 299–311 (2002)

5. Ambainis, A., Yakaryılmaz, A.: Superiority of exact quantum automata for promise problems. Information Processing Letters 112(7), 289–291 (2012)

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

1. Unary probabilistic and quantum automata on promise problems;Quantum Information Processing;2017-12-26

2. Unary Probabilistic and Quantum Automata on Promise Problems;Developments in Language Theory;2015

3. Classical and Quantum Counter Automata on Promise Problems;Implementation and Application of Automata;2015

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

5. Classical Automata on Promise Problems;Descriptional Complexity of Formal Systems;2014