Quantum Automata and Languages of Finite Index
摘要
This paper continues the study of measure-once finite quantum automata building on work by Bertoni et al. and Blondel et al. We investigate conditions ensuring 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 decidable whether or not they have a nonempty intersection.