Advertisement

The Minimum Amount of Useful Space: New Results and New Directions

  • Klaus Reinhardt
  • Abuzer Yakaryılmaz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8633)

Abstract

We consider minimal space requirements when using memory with restricted access policy (pushdown - hence giving pushdown automata (PDAs), and counter - hence giving counter automata (CAs)) in connection with two-way and realtime head motion. The main results are that: (i) loglogn is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii) there exist unary nonregular languages accepted by realtime alternating CAs within weak logn space, (iii) there exist nonregular languages accepted by two-way DPADs within strong loglogn space, and, (iv) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle logn space and bounded error.

Keywords

Regular Language Quantum Register Input Tape Logarithmic Space Unary Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amano, M., Iwama, K.: Undecidability on quantum finite automata. In: STOC 1999: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pp. 368–375 (1999)Google Scholar
  2. 2.
    Ambainis, A., Watrous, J.: Two–way finite automata with quantum and classical states. Theoretical Computer Science 287(1), 299–311 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114–133 (1981)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Ďuriš, P.: Private communication (October 2013)Google Scholar
  5. 5.
    Ďuriš, P., Galil, Z.: On reversal-bounded counter machines and on pushdown automata with a bound on the size of their pushdown store. Information and Control 54(3), 217–227 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite-state automata. SIAM Journal on Computing 19(6), 1011–1123 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Freivalds, R.: Probabilistic two-way machines. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol. 118, pp. 33–45. Springer, Heidelberg (1981)Google Scholar
  8. 8.
    Freivalds, R.: Space and reversal complexity of probabilistic one-way Turing machines. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 159–170. Springer, Heidelberg (1983)Google Scholar
  9. 9.
    Freivalds, R., Karpinski, M.: Lower space bounds for randomized computation. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 580–592. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  10. 10.
    Gabarró, J.: Pushdown space complexity and related full-A.F.L.s. In: Fontet, M., Mehlhorn, K. (eds.) STACS 1984. LNCS, vol. 166, pp. 250–259. Springer, Heidelberg (1984)CrossRefGoogle Scholar
  11. 11.
    Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM 9(3), 350–371 (1962)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Kaņeps, J.: Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 287–296. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  13. 13.
    Kaņeps, J., Freivalds, R.: Minimal nontrivial space complexity of probabilistic one-way Turing machines. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 355–361. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  14. 14.
    Kaņeps, J., Geidmanis, D., Freivalds, R.: Tally languages accepted by Monte Carlo pushdown automata. In: Rolim, J.D.P. (ed.) RANDOM 1997. LNCS, vol. 1269, pp. 187–195. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  15. 15.
    Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75 (1997)Google Scholar
  16. 16.
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)Google Scholar
  17. 17.
    Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)zbMATHGoogle Scholar
  18. 18.
    Rabin, M.O.: Probabilistic automata. Information and Control 6, 230–243 (1963)CrossRefzbMATHGoogle Scholar
  19. 19.
    Reinhardt, K.: A tree-height hierarchy of context-free languages. International Journal of Foundations of Computer Science 18(6), 1383–1394 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Szepietowski, A.: Turing Machines with Sublogarithmic Space. LNCS, vol. 843. Springer, Heidelberg (1994)zbMATHGoogle Scholar
  21. 21.
    Yakaryılmaz, A.: Superiority of one-way and realtime quantum machines. RAIRO - Theoretical Informatics and Applications 46(4), 615–641 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Yakaryılmaz, A.: One-counter verifiers for decidable languages. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 366–377. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  23. 23.
    Yakaryılmaz, A.: Public qubits versus private coins. In: The Proceedings of Workshop on Quantum and Classical Complexity, pp. 45–60. Univeristy of Latvia Press (2013), ECCC:TR12-130Google Scholar
  24. 24.
    Yakaryılmaz, A., Say, A.C.C.: Efficient probability amplification in two-way quantum finite automata. Theoretical Computer Science 410(20), 1932–1941 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    Yakaryılmaz, A., Say, A.C.C.: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics and Theoretical Computer Science 12(2), 19–40 (2010)zbMATHMathSciNetGoogle Scholar
  26. 26.
    Yakaryılmaz, A., Say, A.C.C.: Tight bounds for the space complexity of nonregular language recognition by real-time machines. International Journal of Foundations of Computer Science 24(8), 1243–1253 (2013)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Klaus Reinhardt
    • 1
    • 2
  • Abuzer Yakaryılmaz
    • 3
    • 4
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversity of TübingenGermany
  2. 2.Humboldt University of BerlinGermany
  3. 3.Faculty of ComputingUniversity of LatviaRīgaLatvia
  4. 4.National Laboratory for Scientific ComputingPetrópolisBrazil

Personalised recommendations