Note on equivalence of cutpoint languages recognized by measure many quantum finite automata
Tianrong Lin · arXiv (Cornell University) · 2013
This note revisits the equivalence of languages recognized by measure many one way quantum finite automata with non/strict cutpoint. The main contributions are as follows: \begin{enumerate}[(1)] \item {We provide an additional proof of the undecidability of non/strict emptiness of measure many one way quantum finite automata;} \item {By the undecidability of non/strict emptiness of measure many one way quantum finite automata, we show that the equivalence of languages recognized by measure many one way quantum finite automata with non/strict cutpoint is undecidable, implying the undecidability of containment problem of measure many one way quantum finite automata} \end{enumerate}