Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
| Hi-index | 0.00 |
The space and time bounds of Turing machines which process contentless inputs, i.e., inputs of the form a^n are investigated. There is such a Turing machine which uses space bounded by log log n but not space bounded by any constant. Properties of this processor are given. The general properties of Turing machines processing contentless inputs are discussed. Any nontrivial processor can be transformed into a recognizer of a nonregular language in the same input alphabet and using exactly the same space. Finally, a theorem which establishes a hierarchy of contentless languages whose recognizers require at least log n space is given.