Counter machines and counter languages
- Cite this article as:
- Fischer, P.C., Meyer, A.R. & Rosenberg, A.L. Math. Systems Theory (1968) 2: 265. doi:10.1007/BF01694011
- 199 Downloads
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.