On the Time and Tape Complexity of Languages I

@inproceedings{Hunt1973OnTT,
  title={On the Time and Tape Complexity of Languages I},
  author={Harry B. Hunt},
  booktitle={STOC},
  year={1973}
}
We investigate the following: (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines; (2) the time and tape complexity of many predicates on the regular sets; (3) the relationship between the classes of languages accepted by deterministic or nondeterministic polynomial time bounded Turing machines and the class of languages accepted by polynomial tape bounded Turing machines; and (4) the complexity of many… CONTINUE READING