Searching for "Quantum Finite Automata." – sorted by Relevance.
-
ikusts. Probabilities to accept languages by quantum finite automata
- arXiv:quant-ph/9904066v1 16 Apr 1999 Probabilities to accept languages by quantum finite automata
- Cited by 4 (0 self) – Add To MetaCart
-
Characterizations of 1-Way Quantum Finite Automata
- Characterizations of 1-Way Quantum Finite Automata Alex Brodsky Department of Computer Science
- Cited by 11 (0 self) – Add To MetaCart
-
Dense Quantum Coding and Quantum Finite Automata
- Dense Quantum Coding and Quantum Finite Automata ANDRIS AMBAINIS Institute for Advanced Study
- Add To MetaCart
-
On the Class of Languages Recognizable By 1-Way Quantum Finite Automata
- On the class of languages recognizable by 1-way quantum nite automata Andris Ambainis 1 , Arnolds
- Cited by 5 (0 self) – Add To MetaCart
-
Quantum Automata and Algebraic Groups
- to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool
- Cited by 2 (0 self) – Add To MetaCart
-
On the Power of Quantum Finite State Automata
- On the Power of Quantum Finite State Automata Attila Kondacs John Watrous y Computer Science
- Cited by 42 (4 self) – Add To MetaCart
-
On the Power of 2-Way Quantum Finite State Automata
- On the Power of 2-Way Quantum Finite State Automata John Watrous Computer Sciences Department
- Cited by 2 (0 self) – Add To MetaCart
-
On Quantum Pushdown Automata
- , University of Latvia, Raiņa bulv. 29, Riga, Latvia ⋆ marats@(email omitted); Abstract. Quantum finite automata
- Cited by 2 (0 self) – Add To MetaCart
-
Probabilistic and Quantum Automata for
- to be crucially important to prove undecidability of emptiness problem for 2-tape quantum finite automata
- Add To MetaCart
-
Quantum Finite State Transducers
- their `little brothers', the quantum finite automata, the power of qfst is incomparable
- Cited by 1 (0 self) – Add To MetaCart

