Skip to main content
SpringerLink
Log in

Quantum Finite Automata and Logics

  • Conference paper
SOFSEM 2006: Theory and Practice of Computer Science (SOFSEM 2006)

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

  • 842 Accesses

Abstract

The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindström quantifier is shown.

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. Aharonov, D., Kitaev, A., Nisan, N.: Quantum Circuits with Mixed States. In: STOC, pp. 20–30 (1998)

    Google Scholar 

  2. Amano, M., Iwama, K.: Undecidability on Quantum Finite Automata. In: STOC, pp. 368–375 (1999)

    Google Scholar 

  3. Ambainis, A., Freivalds, R.: 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. In: Proc. FOCS, pp. 332–341 (1998)

    Google Scholar 

  4. Ambainis, A., Kikusts, A.: Exact Results for Accepting Probabilities of Quantum Automata. Theoretical Computer Science 295(1), 5–23 (2003)

    Article  MathSciNet  Google Scholar 

  5. Ambainis, A., Watrous, J.: Two-Way Finite Automata with Quantum and Classical States. Theoretical Computer Science 287(1), 299–311 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Baader, F.: Automata and Logic. Technische Universittät Dresden (2003)

    Google Scholar 

  7. Barrington, D.A., Compton, K., Straubing, H., Therien, D.: Regular Languages in NC1, BCCS-88-02 (1988)

    Google Scholar 

  8. Barrington, D.A., Corbett, J.: On the Relative Complexity of Some Languages in NC 1. Inf. Proc. Letters 32, 251–256 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brodsky, A., Pippenger, N.: Characterizations of 1-Way Quantum Finite Automata. SIAM Journal on Computing 31(5), 1456–1478 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Büchi, J.R.: Weak Second-Order Arithmetic and Finite Automata. Z. Math. Logik Grundl. Math. 6, 66–92 (1960)

    Article  MATH  Google Scholar 

  11. Büchi, J.R.: On Decision Method in Restricted Second-Order Arithmetic. In: Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford Univ. Press, Stanford (1962)

    Google Scholar 

  12. Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic Press, New York (1976)

    MATH  Google Scholar 

  13. Elgot, C.C.: Decision Problems of Finite Automata Design and Related Arithmetics. Trans. Amer. Math Soc. 98, 21–52 (1961)

    Article  MathSciNet  Google Scholar 

  14. Fagin, R.: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Complexity of Computation, SIAM-AMS Proceedings, vol. 7, pp. 43–73 (1974)

    Google Scholar 

  15. Gruska, J.: Quantum Computing, vol. 439. McGraw-Hill, New York (1999)

    Google Scholar 

  16. Immerman, N.: Relational Queries Computable in Polynomial Time. Information and Control 68, 86–104 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  17. Immerman, N.: Languages that Capture Complexity Classes. SIAM J. Comput. 16(4), 760–778 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. Immerman, N.: Nondeterministic Space Is Closed under Complementation. SIAM J. Comput. 17(5), 938–953 (1988)

    Article  MathSciNet  Google Scholar 

  19. Kondacs, A., Watrous, J.: On the Power of Quantum Finite State Automata. In: Proc. FOCS 1997, pp. 66–75 (1997)

    Google Scholar 

  20. McNaugton, R.: Symbolic Logic and Automata. Technical Note, 60–244 (1960)

    Google Scholar 

  21. McNaughton, R.: Testing and Generating Infinite Sequences by Finite Automaton. Inform. Contr. 9, 521–530 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  22. Moore, C., Crutchfield, J.: Quantum Automata and Quantum Grammars. Theoretical Computer Science 237, 275–306 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  23. Mostowski, A.: On a Generalization of Quantifiers. Fundamenta Mathenaticae 44, 12–36 (1957)

    MathSciNet  Google Scholar 

  24. Rabin, M.O.: Decidability of Second-Order Theories and Automata on Infinite Trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  25. Schüzenberg, M.P.: On Finite Monoids Having only Trivial Subgroups. Information and Control 8, 283–305 (1965)

    Google Scholar 

  26. Straubing, H., Therien, D., Thomas, W.: Regular Languages Defined with Generalized Quantifiers. In: Lepistö, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 561–575. Springer, Heidelberg (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulvāris 29, LV–1459, Riga, Latvia

    Ilze Dzelme

Authors
  1. Ilze Dzelme
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2, 182 07, Prague 8, Czech Republic

    Jiří Wiedermann  & Július Štuller  & 

  2. Department of Information and Computer Sciences, University of Utrecht, P.O. Box 80.089, 3508, Utrecht, TB, The Netherlands

    Gerard Tel

  3. Faculty of Mathematics and Physics, Charles University, Prague

    Jaroslav Pokorný

  4. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava

    Mária Bieliková

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dzelme, I. (2006). Quantum Finite Automata and Logics. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_22

Download citation

  • DOI: https://doi.org/10.1007/11611257_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31198-0

  • Online ISBN: 978-3-540-32217-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation