On the Intersection Problem for Quantum Finite Automata

Abstract

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.

arXiv admin note: text overlap with arXiv:1303.2967 -- Expanded version, with different title. To appear in Theoretical Computer Science