Complexity problems in real time languages

  • Authors:

  • W. A. Burkhard;P. P. Varaiya

  • Affiliations:

  • -;Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California, USA and Electronics Research Laboratory University of California, Berkeley, California, ...

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 1971

Quantified Score

Hi-index 0.07

Visualization

Abstract

The study of computational complexity is continued under the additional requirement that the Turing machines operate in real time. The work reported here is motivated by that of Rabin [I] which asks implicitly about the computational power of n tape vs. n+1 tape real time Turing machines and that of Hartmanis [2], who attempts a complexity measure for Turing machines in terms of reversals. The first result concerns itself with n tape real time Turing machines operating in a reversal bounded mode. A doubly infinite hierarchy (tapes-reversals) of classes of real time computable functions is shown to exist. The second result deals with n deterministic real time pushdown automata operating independently in parallel. It is shown that an increase in the number of pushdown automata operating in this manner always yields an increase in the computational power of the configuration.