Abstract
We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is recursively decidable whether or not they have a nonempty intersection. This extends a result of Blondel et al. which can be interpreted as solving the problem with the free monoid in place of the family of linear context-free languages. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Bertoni, A., Choffrut, C., & D’Alessandro, F. (2013). Quantum finite automata and linear context-free languages: A decidable problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 82–93). https://doi.org/10.1007/978-3-642-38771-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
