Skip to main content
SpringerLink
Log in

A time-space tradeoff for language recognition

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We define a languageL and show that its time and space complexitiesT andS must satisfyT 2 S ≥cn 3 even allowing machines with multiple (non random) access to the input.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Cobham, The recognition problem for perfect squares,Proceedings 7th IEEE Symposium on SWAT, Berkeley, Calif., October 1966, 78–87.

  2. A. B. Borodin, M. J. Fischer, D. G. Kirkpatrick, N. A. Lynch, and M. Tompa, A time-space tradeoff for sorting on non-oblivious machines.Proceedings 20th IEEE Symposium on FOCS, San Juan, Puerto Rico, October 1979, 319–327.

  3. A. B. Borodin and S. A. Cook, A time-space tradeoff for sorting on a general sequential model of computation,Proceedings 12th ACM, STOC., Los Angeles, Calif., April 1980, 294–301.

  4. Z. Galil and J. Seiferas, Time-space-optimal string matching,J. Computer Sys. Sciences 26 (1983), 280–294.

    Google Scholar 

  5. R. L. Rivest and A. C. C. Yao,k+1 heads are better thank, JACM 25, 2(1978), 337–340.

    Google Scholar 

  6. L. Janiga, Real-time computations of two-way multihead finite automata, inFundamentals of Computation Theory (FCT 79) (L. Budach ed.), Akademic Verlag, Berlin, 214–219.

  7. P. Dúriś and Z. Galil, Fooling a two way automaton or One pushdown store is better than one counter for two way machines,Theoretical Computer Science 21 (1982), 39–53.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Center, Slovak Academy of Science, Bratislava, Czechoslovakia

    Pavol Dúriś

  2. Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel

    Pavol Dúriś & Zvi Galil

  3. Department of Computer Science, Columbia University, New York, USA

    Pavol Dúriś & Zvi Galil

Authors
  1. Pavol Dúriś
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zvi Galil
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The second author was supported in part by the Israel Commission for Basic Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dúriś, P., Galil, Z. A time-space tradeoff for language recognition. Math. Systems Theory 17, 3–12 (1984). https://doi.org/10.1007/BF01744430

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01744430

Keywords

Search

Navigation