Variations on pushdown machines (Detailed Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Nondeterministic tape bounded turing machines
Nondeterministic tape bounded turing machines
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Tree-size bounded alternation(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The language intersection problem for non-recursive context-free grammars
Information and Computation
The tape-complexity of context-independent developmental languages
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Algorithmic aspects of natural language processing
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
Our main result, theorem 2, gives a bound on the storage required for a Turing machine to simulate certain time-bounded pushdown machines. The theorem is a generalization of the result appearing in [3] stating that any context-free language can be recognized by a deterministic Turing machine within storage (log n)2. We introduce a combinatorial object, called a path system, develop its theory briefly, and use the theory to prove both the result on pushdown machines and the result on context free languages, as well as a third result. The third result is the Theorem of Savitch [5] stating that a non-deterministic L(n) - storage bounded Turing machine can be simulated by a deterministic (L(n))2 - storage bounded Turing machine.