Some formal tools for analyzing quantum automata-Reference-Cited by-同舟云学术

Some formal tools for analyzing quantum automata

Published:2006-05 Issue:1-2 Volume:356 Page:14-25
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bertoni Alberto,Mereghetti Carlo,Palano Beatrice

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. F.M. Ablayev, A. Gainutdinova, On the lower bounds for one-way quantum automata, in: Proc. 25th MFCS, Lecture Notes in Computer Science, Vol. 1893, 2000, pp. 132–140.

2. A. Ambainis, R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalizations, in: Proc. 39th FOCS, 1998, pp. 332–342.

3. A. Ambainis, A. Kikusts, M. Valdats, On the class of languages recognizable by 1-way quantum finite automata, in: Proc. 18th STACS, Lecture Notes in Computer Science, Vol. 2010, 2001, pp. 305–316.

4. Gröbner Bases, A Computational Approach to Commutative Algebra;Becker,1993

5. Quantum complexity theory;Bernstein;SIAM J. Comput.,1997

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

1. Lifting query complexity to time-space complexity for two-way finite automata;Journal of Computer and System Sciences;2024-05

2. Guest Column;ACM SIGACT News;2021-10-17

3. Photonic realization of a quantum finite automaton;Physical Review Research;2020-01-28

4. Promise problems solved by quantum and classical finite automata;Theoretical Computer Science;2017-03

5. Quantum finite automata: Advances on Bertoni's ideas;Theoretical Computer Science;2017-02