Undecidability on Quantum Finite Automata

@inproceedings{Amano1999UndecidabilityOQ,
  title={Undecidability on Quantum Finite Automata},
  author={Masami Amano and Kazuo Iwama},
  booktitle={STOC},
  year={1999}
}
Our model in this paper is a 1.5.way quantum finite automaton which can move its head 0 or +1 position but not -1 position. It is shown that the most fundamental decision question, the emptiness problem, is not solvable for this model. Note that the emptiness problem is solvable far push-down automata and even for one-way nondeterministic stack automata. 

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

References

Publications referenced by this paper.

Ullman

J. Hopcroft, .I
” Deterministic stack automata and the quotient operator,” JCSS, 2:1, l-12, • 1968
View 2 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…