Skip to main content
SpringerLink
Log in

Computation with Absolutely No Space Overhead

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2710))

Included in the following conference series:

Abstract

We study Turing machines that are allowed absolutely no space overhead. The only work space the machines have, beyond the fixed amount of memory implicit in their finite-state control, is that which they can create by cannibalizing the input bits’ own space. This model more closely reflects the fixed-sized memory of real computers than does the standard complexity-theoretic model of linear space. Though some context-sensitive languages cannot be accepted by such machines, we show that subclasses of the context-free languages can even be accepted in polynomial time with absolutely no space overhead.

Supported in part by grants NSF-CCR-9322513 and NSF-INT-9815095 /DAAD-315-PPP-gü-ab.

Work done in part while visiting the University of Rochester, supported by a TU Berlin Erwin-Stephan-Prize grant.

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. A. Amir, G. Landau, and D. Sokol. Inplace run-length 2D compressed search. Theoretical Computer Science, 290(3):1361–1383, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  2. N. Chomsky and M. Schützenberger. The algebraic theory of context-free languages. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 118–161. North Holland, Amsterdam, 1963.

    Google Scholar 

  3. E. Dijkstra. Smoothsort, an alternative for sorting in situ. Science of Computer Programming, 1(3):223–233, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Dijkstra and A. van Gastern. An introduction to three algorithms for sorting in situ. Information Processing Letters, 15(3):129–134, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  5. E. Feldman and J. Owings, Jr. A class of universal linear bounded automata. Information Sciences, 6:187–190, 1973.

    Article  MathSciNet  Google Scholar 

  6. K. Fishkin. Performing in-place affine transformations in constant space. In Proceedings of Graphics Interface’ 92, pages 106–114, 1992.

    Google Scholar 

  7. V. Geffert, J. Katajainen, and T. Pasanen. Asymptotically efficient in-place merging. Theoretical Computer Science, 237(1–2):159–181, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Geske. Nondeterminism, bi-immunity and almost-everywhere complexity. IEICE Trans. on Communications, Electronics, Information, and Systems, E76, 1993.

    Google Scholar 

  9. J. Hartmanis. On non-determinancy in simple computing devices. Acta Informatica, 1:336–344, 1972.

    Article  MATH  MathSciNet  Google Scholar 

  10. L. Hemaspaandra, P. Mukherji, and T. Tantau. Computation with absolutely no space overhead. Technical Report TR-779, Department of Computer Science, University of Rochester, Rochester, NY, May 2002.

    Google Scholar 

  11. M. Holzer and K. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Proc. of the 9th Conference on Fundamentals of Computation Theory, volume 710 of Lecture Notes in Computer Science, pages 299–308. Springer-Verlag, 2003.

    Google Scholar 

  12. J. Hopcroft and J. Ullman. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.

    Google Scholar 

  13. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  14. O. Ibarra, T. Jiang, and B. Ravikumar. Some subclasses of context-free languages in NC1. Information Processing Letters, 29(3):111–117, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  15. N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935–938, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  16. T. Kasami. An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab., Bedford, Mass., 1965.

    Google Scholar 

  17. J. Katajainen and T. Pasanen. In-place sorting with fewer moves. Information Processing Letters, 70:31–37, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  18. M. Nasu and N. Honda. Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata. Information and Control, 15(3):250–273, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  19. A. Paz. Introduction to Probabilistic Automata. Academic Press, New York, 1971.

    MATH  Google Scholar 

  20. A. Salomaa. Formal Languages. Academic Press, 1973.

    Google Scholar 

  21. J. Seiferas. Relating refined space complexity classes. Journal of Computer and System Sciences, 14:100–129, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  22. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279–284, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  23. D. Younger. Recognition and parsing of context-free languages in time n 3. Information and Control, 10(2):189–208, 1967.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Rochester, Rochester, NY, 14627, USA

    Lane A. Hemaspaandra & Proshanto Mukherji

  2. Fakultät IV — Elektrotechnik und Informatik, Technische Universität Berlin, Berlin, Germany

    Till Tantau

Authors
  1. Lane A. Hemaspaandra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Proshanto Mukherji
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Till Tantau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hemaspaandra, L.A., Mukherji, P., Tantau, T. (2003). Computation with Absolutely No Space Overhead. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation