On the Size of One-way Quantum Finite Automata with Periodic Behaviors-Reference-Cited by-同舟云学术

On the Size of One-way Quantum Finite Automata with Periodic Behaviors

Published:2002-07 Issue:3 Volume:36 Page:277-291
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Mereghetti Carlo,Palano Beatrice

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita:2002014/pdf

Reference23 articles.

1. A. Aho, J. Hopcroft and J. Ullman,The Design and Analysis of Computer Algorithms. Addison-Wesley (1974).

2. On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages

3. A. Ambainis and J. Watrous,Two-way Finite Automata with Quantum and Classical States. Technical Report (1999) quant-ph/9911009.

4. A. Ambainis and R. Freivalds, 1-way Quantum Finite Automata: Strengths, Weaknesses and Generalizations, inProc. 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press (1998) 332-342.

5. A. Brodsky and N. Pippenger,Characterizations of 1-Way Quantum Finite Automata, Technical Report. Department of Computer Science, University of British Columbia,TR-99-03 (revised).

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

1. Unary Quantum Finite State Automata with Control Language;Applied Sciences;2024-02-12

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

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

4. Exponentially more concise quantum recognition of non-RMM regular languages;Journal of Computer and System Sciences;2015-03

5. On the state complexity of semi-quantum finite automata;RAIRO - Theoretical Informatics and Applications;2014-04