Skip to main content
SpringerLink
Log in

Counter machines and counter languages

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The languages recognizable by time- and space-restricted multiple-counter machines are compared to the languages recognizable by similarly restricted multipletape Turing machines. Special emphasis is placed on languages definable by machines which operate in “real time”. Time and space requirements for counter machines and Turing machines are analyzed. A number of questions which remain open for time-restricted Turing machines are settled for their counter machine counterparts.

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, Time and memory capacity bounds for machines which recognize squares or palindromes,IBM Research Report RC-1621, 1966.

  2. P. C. Fischer, Turing machines with restricted memory access.Information and Control 9 (1966), 364–379.

    Google Scholar 

  3. M. J. Fischer andA. L. Rosenberg, Real-time solutions of the origin-crossing problem.Math. Systems Theory 2 (1968), 257–263.

    Google Scholar 

  4. S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.

    Google Scholar 

  5. S. Ginsburg andE. H. Spanier, BoundedAlgol-like languages,Trans. Amer. Math. Soc. 113 (1964), 333–368.

    Google Scholar 

  6. J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285–306.

    Google Scholar 

  7. R. Laing, Realization and complexity of commutative events,Univ. of Mich. Technical Report 03105-48-T, 1967.

  8. M. Minsky, Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines,Ann. of Math. 74 (1961), 437–455.

    Google Scholar 

  9. A. G. Oettinger, Automatic syntactic analysis and the pushdown store,Proc. 12th Ann. Sympos. in Appl. Math., 1960, pp. 104–129.

  10. R. J. Parikh, On context-free languages.J. Assoc. Comput. Mach. 13 (1966), 570–581.

    Google Scholar 

  11. M. O. Rabin, Real-time computation,Israel J. Math. 1 (1963), 203–211.

    Google Scholar 

  12. M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.

    Google Scholar 

  13. A. L. Rosenberg, Real-time definable languages,J. Assoc. Comput. Mach. 14 (1967), 645–662.

    Google Scholar 

  14. R. E. Stearns, J. Hartmanis andP. Lewis, Hierarchies of memory-limited computation,Proc. 6th Ann. Sympos. Switching Circuit Theory and Logical Design, Ann Arbor, Mich., 1966, pp. 179–190.

Download references

Author information

Author notes

  1. Patrick C. Fischer

    Present address: University of British Columbia, Vancouver, B. C., Canada

  2. Albert R. Meyer

    Present address: Carnegie-Mellon University, Pittsburgh, Pennsylvania, USA

Authors and Affiliations

  1. Cornell University, Ithaca, New York, USA

    Patrick C. Fischer

  2. IBM Watson Research Center, Yorktown Heights, New York, USA

    Albert R. Meyer & Arnold L. Rosenberg

Authors
  1. Patrick C. Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Albert R. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arnold L. Rosenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Preparation of this paper was partially supported by National Science Foundation Grant GP-7701.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischer, P.C., Meyer, A.R. & Rosenberg, A.L. Counter machines and counter languages. Math. Systems Theory 2, 265–283 (1968). https://doi.org/10.1007/BF01694011

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation