One-way probabilistic reversible and quantum one-counter automata.

DOI10.1016/S0304-3975(01)00412-1zbMath1061.68099MaRDI QIDQ1853577

Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai, Tomohiro Yamasaki

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Quantum computingone-way automataCounter automata

Mathematics Subject Classification ID

Related Items (6)

Unnamed Item ⋮ Quantum Pushdown Automata with Garbage Tape ⋮ QUANTUM COUNTER AUTOMATA ⋮ Quantum computation with write-only memory ⋮ Quantum versus deterministic counter automata ⋮ Determining the equivalence for one-way quantum finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines

This page was built for publication: One-way probabilistic reversible and quantum one-counter automata.