Arnold L. Rosenberg
Mathematical Systems Theory
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. © 1968 Springer-Verlag New York Inc.
Arnold L. Rosenberg
Mathematical Systems Theory
Albert R. Meyer, Arnold L. Rosenberg, et al.
SWAT 1967
Patrick C. Fischer, Albert R. Meyer, et al.
Journal of the ACM
Arnold L. Rosenberg
Information Processing Letters