Multi-letter Reversible and Quantum Finite Automata
暂无分享,去创建一个
Ansis Rosmanis | Aleksandrs Belovs | Juris Smotrovs | Juris Smotrovs | Aleksandrs Belovs | A. Rosmanis
[1] Kathrin Paschen. Quantum finite automata using ancilla qubits , 2000 .
[2] Alex Brodsky,et al. Characterizations of 1-Way Quantum Finite Automata , 2002, SIAM J. Comput..
[3] Grzegorz Rozenberg,et al. Developments in Language Theory II , 2002 .
[4] Massimo Pica Ciamarra. Quantum Reversibility and a New Model of Quantum Automaton , 2001, FCT.
[5] Alberto Bertoni,et al. Quantum Computing: 1-Way Quantum Automata , 2003, Developments in Language Theory.
[6] James P. Crutchfield,et al. Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..
[7] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[8] Andris Ambainis,et al. Algebraic Results on Quantum Automata , 2005, Theory of Computing Systems.
[9] Ashwin Nayak,et al. Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[10] Andris Ambainis,et al. 1-way quantum finite automata: strengths, weaknesses and generalizations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[11] John Watrous,et al. On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[12] Juraj Hromkovic,et al. One-way multihead deterministic finite automata , 1983, Acta Informatica.
[13] Robin Milner. An Action Structure for Synchronous pi-Calculus , 1993, FCT.
[14] Costas S. Iliopoulos,et al. Symposium on Theoretical Aspects of Computer Science , 2008 .