, Volume 2, Issue 3, pp 265-283

Counter machines and counter languages

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

Preparation of this paper was partially supported by National Science Foundation Grant GP-7701.
A portion of this paper was presented at the Eighth Annual Symposium on Switching and Automata Theory, Austin, Texas, October, 1967.