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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anisimov, A.V., Seifert, F.D.: Zur algebraischen Charakteristik der durch Kontext-freie Sprachen definierten Gruppen. Elektron. Inform. Verarb. u. Kybern. 11, 695–702 (1975)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2003)
Bertoni, A., Choffrut, C., D’Alessandro, F.: Quantum finite automata and linear context-free languages, Preprint arXiv:1303.2967 (2013)
Blondel, V.D., Jeandel, E., Koiran, P., Portier, N.: Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput. 34, 1464–1473 (2005)
Derksen, H., Jeandel, E., Koiran, P.: Quantum automata and algebraic groups. J. Symb. Comput. 39, 357–371 (2005)
Hopcroft, J., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Jeandel, E.: Indécidabilité sur les automates quantiques. Master’s thesis. ENS Lyon (2002)
Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 66–75 (1997)
Moore, C., Crutchfield, J.: Quantum automata and quantum grammars. Theoret. Comput. Sci. 237, 275–306 (2000)
Onishchik, A., Vinberg, E.: Lie Groups and Algebraic Groups. Springer, Berlin (1990)
Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoni, A., Choffrut, C., D’Alessandro, F. (2013). Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-38771-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38770-8
Online ISBN: 978-3-642-38771-5
eBook Packages: Computer ScienceComputer Science (R0)