Quantum automata and languages of finite index
<|reference_start|>Quantum automata and languages of finite index: 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.<|reference_end|>
@article{benso2024quantum,
    title={Quantum automata and languages of finite index},
    author={Andrea Benso, Flavio D'Alessandro, Paolo Papi},
    journal={arXiv preprint arXiv:2406.13797},
    year={2024},
    number={Roma01.Math},
    archivePrefix={arXiv},
    eprint={2406.13797},
    primaryClass={cs.FL}
}