Quantum finite multitape automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1725, Issue , 1999, Pages 340-348

  Ambainis, Andris ^a   Bonner, Richard ^b   Freivalds, Rusins ^c   Golovkins, Marats ^c   Karpinski, Marek ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MÄLARDALEN UNIVERSITY   (Sweden)

^c UNIVERSITY OF LATVIA   (Latvia)

^d UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; INFORMATION SCIENCE; QUANTUM COMPUTERS;

DETERMINISTIC FINITE AUTOMATA; MULTI-TAPE AUTOMATON; PROBABILISTIC AUTOMATA; PROBABILISTIC FINITE AUTOMATA; QUANTUM FINITE AUTOMATA;

FINITE AUTOMATA;

EID: 84957016687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47849-3_21     Document Type: Conference Paper

References (4)

1. Andris Ambainis and Rūsņš Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. 39th FOCS, 1998, pp. 332-341. http://xxx.lanl.gov/abs/quant-ph/9802062.
2. Rusins Freivalds. Fast probabilistic algorithms. Lecture Notes in Computer Science, 1979, Vol. 74, pp. 57-69.
3. Attila Kondacs and John Watrous. On the power of quantum finite state automata. In Proc. 38th FOCS, 1997, pp. 66-75.
4. Christopher Moore, James P. Crutchfield Quantum automata and quantum grammars. http://xxx.lanl.gov/abs/quant-ph/9707031.