Probabilities to Accept Languages by Quantum Finite Automata-Reference-Cited by-同舟云学术

Probabilities to Accept Languages by Quantum Finite Automata

Published:1999 Issue: Volume: Page:174-183
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ambainis Andris,Bonner Richard,Freivalds Rūsiņš,Ķikusts Arnolds

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48686-0_17

Reference13 articles.

1. Andris Ambainis and Rūsiņš Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. 39th FOCS, 1998, p. 332–341. http://xxx:lanl.gov/abs/quant-ph/9802062

2. Charles Bennett. Time-space tradeoffs for reversible computation. SIAM J. Computing, 18:766–776, 1989.

3. A. Brodsky, N. Pippenger. Characterizations of 1-way quantum finite automata. http://xxx.lanl.gov/abs/quant-ph/9903014

4. Ethan Bernstein, Umesh Vazirani, Quantum complexity theory. Proceedings of STOC'93, pp.1–10.

5. Ethan Bernstein, Umesh Vazirani, Quantum complexity theory. SIAM Journal on Computing, 26:1411–1473, 1997.

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

1. Deterministic Construction of QFAs Based on the Quantum Fingerprinting Technique;Lobachevskii Journal of Mathematics;2023-02

2. Two-Way Nanoscale Automata;Advances in Intelligent Systems and Computing;2021

3. Another approach to the equivalence of measure-many one-way quantum finite automata and its application;Journal of Computer and System Sciences;2012-05

4. Quantum Automata with Open Time Evolution;Nature-Inspired Computing Design, Development, and Applications;2012

5. Quantum Automata Theory – A Review;Algebraic Foundations in Computer Science;2011