The tape complexity of context-free languages is investigated. It is shown that all the members of two distinct subclasses of deterministic context-free languages are recognizable in O(log n) tape complexity on off-line deterministic Turing machines
An intriguing question is whether (log n)2 space is enough to recognize the class of languages reco...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
We present two restricted versions of one-tape Turing machines. Both characterize the class of conte...
It is shown that (1) every context-free language is T(n) = n4-recognizable by a single-tape Turing m...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
We show that languages in the least full AFL enclosing all E0L-languages are of tape-complexity (log...
An intriguing question is whether (log n)2 space is enough to recognize the class of languages reco...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
We present two restricted versions of one-tape Turing machines. Both characterize the class of conte...
It is shown that (1) every context-free language is T(n) = n4-recognizable by a single-tape Turing m...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
We show that languages in the least full AFL enclosing all E0L-languages are of tape-complexity (log...
An intriguing question is whether (log n)2 space is enough to recognize the class of languages reco...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
DOI
Add to ORKG