Memory bounds for recognition of context-free and context-sensitive languages

  • Authors:

  • P. M. Lewis;R. E. Stearns;J. Hartmanis

  • Affiliations:

  • -;-;-

  • Venue:
  • FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
  • Year:
  • 1965

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy. The previous complexity classes are shown to possess certain translational properties. An related hierarchy of complexity classes of monotonic functions is examined