Special Issue – Developments in Language Theory (DLT 2013)No Access
ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES
https://doi.org/10.1142/S0129054114400243Cited by:2 (Source: Crossref)
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 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.
The third author acknowlegdes the support of fundings “AST 2009” of the University of Rome “La Sapienza”.
