Quantum finite one-counter automata

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

Volumn 1725, Issue , 1999, Pages 431-440

  Kravtsev, Maksim ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; INFORMATION SCIENCE; QUANTUM THEORY;

COUNTER AUTOMATA; LANGUAGE RECOGNITION; UNITARITY;

AUTOMATA THEORY;

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

References (4)

1. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In Proc. 38th FOCS (1997), 66–75.
2. Gruska, J.: Quantum Computing, McGraw Hill (1999).
3. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In Proc. 39th FOCS (1998), 332–341.
4. Moore, C., Crutchfield, J. P.: Quantum Automata and Quantum Grammars http://xxx.lanl.gov/quant-ph/970731.