Size of Quantum Finite State Transducers | SpringerLink
Skip to main content
Springer Nature Link
Log in

Size of Quantum Finite State Transducers

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

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

  • 1738 Accesses

Abstract

Sizes of quantum and deterministic finite state transducers are compared in the case when both quantum and deterministic finite state transducers exist. The difference in size may be exponential.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

  3. Bonner, R., Freivalds, R., Gailis, R.: Undecidability of 2–Tape Quantum Finite Automata. In: Bonner, R., Freivalds, R. (eds.) Proceedings of Quantum Computation and Learning, Sundbyholms Slott, Sweden, 27–29 May 2000, pp. 93–100. Malardalen University (2000)

    Google Scholar 

  4. Freivalds, R.: Language Recognition Using Finite Probabilistic Multitape and Multihead Automata. Problems Inform. Transmission 15(3), 235–241 (1979)

    MATH  MathSciNet  Google Scholar 

  5. Freivalds, R., Winter, A.J.: Quantum Finite State Transducers. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, p. 233. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Gurari, E.: Introduction to the Theory of Computation. Computer Science Press, Rockville (1989)

    Google Scholar 

  7. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand, Princeton (1960)

    MATH  Google Scholar 

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

    Google Scholar 

  9. Rabin, M.O.: Probabilistic Automata. Information and Control 6, 230–245 (1963)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Rīga, Latvia

    Ruben Agadzanyan & Rūsiņš Freivalds

Authors
  1. Ruben Agadzanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rūsiņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen Giuseppe F. Italiano Wiebe van der Hoek Christoph Meinel Harald Sack František Plášil

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Agadzanyan, R., Freivalds, R. (2007). Size of Quantum Finite State Transducers. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69507-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69506-6

  • Online ISBN: 978-3-540-69507-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation