Skip to main content
SpringerLink
Log in

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem

  • Conference paper
Developments in Language Theory (DLT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7907))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    MathSciNet  MATH  Google Scholar 

  2. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2003)

    Book  MATH  Google Scholar 

  3. Bertoni, A., Choffrut, C., D’Alessandro, F.: Quantum finite automata and linear context-free languages, Preprint arXiv:1303.2967 (2013)

    Google Scholar 

  4. Blondel, V.D., Jeandel, E., Koiran, P., Portier, N.: Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput. 34, 1464–1473 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Derksen, H., Jeandel, E., Koiran, P.: Quantum automata and algebraic groups. J. Symb. Comput. 39, 357–371 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hopcroft, J., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)

    Google Scholar 

  7. Jeandel, E.: Indécidabilité sur les automates quantiques. Master’s thesis. ENS Lyon (2002)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. Moore, C., Crutchfield, J.: Quantum automata and quantum grammars. Theoret. Comput. Sci. 237, 275–306 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Onishchik, A., Vinberg, E.: Lie Groups and Algebraic Groups. Springer, Berlin (1990)

    Google Scholar 

  11. Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)

    MATH  Google Scholar 

  12. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Alberto Bertoni

  2. Laboratoire LIAFA, Université de Paris 7, 2, pl. Jussieu, 75251, Paris Cedex 05, France

    Christian Choffrut

  3. Dipartimento di Matematica, Sapienza Università di Roma, Piazzale Aldo Moro 2, 00185, Roma, Italy

    Flavio D’Alessandro

Authors
  1. Alberto Bertoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Choffrut
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Flavio D’Alessandro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIGM, University Paris-Est Marne-la-Vallée, 5 Bd Descartes, Champs-sur-Marne, 77454, Marne-la-Vallée Cedex 2, France

    Marie-Pierre Béal

  2. LIAFA, UMR 7089, University Paris Diderot, 75205, Paris cedex 13, France

    Olivier Carton

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation