Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Toward a Theory of Enumerations
Journal of the ACM (JACM)
Variations on pushdown machines (Detailed Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
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)
A generator of context-sensitive languages
Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Tape-bounded turing acceptors and principal AFLs
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Tape-bounded turing acceptors and principal AFLs
Journal of Computer and System Sciences
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Algorithms and theory of computation handbook
Complexity of nondeterministic multitape computations based on crossing sequences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
| Hi-index | 0.00 |
Complexity classes of formal languages defined by time- and tape-bounded Turing acceptors are studied. Sufficient conditions for these classes to be AFLs are given. Further, it is shown that a time-bounded nondeterministic Turing acceptor need have only two storage tapes.