Counter machines and counter languages

@article{Fischer1968CounterMA,
  title={Counter machines and counter languages},
  author={Patrick C. Fischer and Albert R. Meyer and Arnold L. Rosenberg},
  journal={Mathematical systems theory},
  year={1968},
  volume={2},
  pages={265-283}
}
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. 

From This Paper

Figures, tables, and topics from this paper.
70 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Real - time definable languages

  • P. LEwis
  • J . Assoc . Comput . Mack
  • 1967

LEwis, Hierarchies of memory-limited computation

  • Proc. 6th Ann. Sympos. Switching Circuit Theory…
  • 1966

STEARNS , On the computational complexity of algorithms , Tram

  • J. HARTMANIS, E. R.
  • Amer . Math . Soc .
  • 1964

RABIN, Real-time computation

  • M O.
  • IsraelJ. Math
  • 1963

OETrINGER , Automatic syntactic analysis and the pushdown store

  • G. A.
  • Proc . 12 th Ann . Sympos . in Appl . Math .
  • 1961

PARIKH , On context - free languages

  • J. R.
  • J . Assoc . Comput . Mach .
  • 1960

SCOTt, Finite automata and their decision problems, IBMJ

  • Res. Develop
  • 1959

Bounded ALGOLlike languages

  • E. H. SPANIER
  • Trans . Araer . Math . Soc .

Similar Papers

Loading similar papers…