On the Intersection Problem for Quantum Finite Automata
Andrea Benso, Flavio D’Alessandro, Paolo Papi · arXiv (Cornell University) · 2024
This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions assuring that, given a language recognized by such a device and a language generated by a context-free grammar of finite index or by a matrix context-free grammar, it is recursively decidable whether or not they have a nonempty intersection.