Some Results on Tape-Bounded Turing Machines

Authors:
J. E. Hopcroft;J. D. Ullman
Affiliations:
Cornell University, Ithaca, New York and Bell Telephone Laboratories, Inc., Murray Hill, New Jersey;Bell Telephone Laboratories, Inc., Murray Hill, New Jersey
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 0
Cited 21

Halting Stack Automata

Journal of the ACM (JACM)
An Overview of the Theory of Computational Complexity

Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities

Journal of the ACM (JACM)
On Time Versus Space

Journal of the ACM (JACM)
Unary Pushdown Automata and Auxiliary Space Lower Bounds

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Space Hierarchy Theorem Revised

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Space hierarchy theorem revised

Theoretical Computer Science - Mathematical foundations of computer science
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Some properties of one-pebble turing machines with sublogarithmic space

Theoretical Computer Science
Tight lower bounds for query processing on streaming and external memory data

Theoretical Computer Science
A survey of three-dimensional automata

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Nondeterministic one-tape off-line turing machines and their time complexity

Journal of Automata, Languages and Combinatorics
On the computational power of pushdown automata

Journal of Computer and System Sciences
Space bounds for processing contentless inputs

Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences
Nonexistence of program optimizers in several abstract settings

Journal of Computer and System Sciences
Synchronized alternating turing machines on four-dimensional input tapes

WSEAS Transactions on Computers
Hardware hierarchies and recognizabilities of four-dimensional synchronized alternating turing machines

WSEAS Transactions on Computers
One Pebble Versus ε · log n Bits

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Two-way automata versus logarithmic space

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Tight lower bounds for query processing on streaming and external memory data

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

Classes of tape-bounded Turing machines similar to the on-line and off-line Turing machines, but without the restrictions that each machine halt and be deterministic, are studied. It is shown that the lower bounds on tape complexity of [1] depend on neither the halting assumption nor determinism. The existence of a dense hierarchy of complexity classes likewise does not depend on the halting assumption, and it is shown that below log n tape complexity there exists a dense hierarchy of complexity classes for two-way nondeterministic devices. It is also shown that the complexity classes of one-way, nondeterministic machines below linear large complexity are not closed under complementation and are larger that the corresponding deterministic complexity class.