DOIAbstract
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity T(n)≥n2. Then L is also recognized by a deterministic (single-tape) Turing machine of tape complexity T1/2(n)
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity T(n)≥n2. Then L is also recognized by a deterministic (single-tape) Turing machine of tape complexity T1/2(n)
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turin...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
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...
The tape complexity of context-free languages is investigated. It is shown that all the members of t...
AbstractLet L be a language recognized by a nondeterministic d-dimensional Turing machine with one w...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing mach...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
It is shown that (1) every context-free language is T(n) = n4-recognizable by a single-tape Turing m...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turin...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
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...
The tape complexity of context-free languages is investigated. It is shown that all the members of t...
AbstractLet L be a language recognized by a nondeterministic d-dimensional Turing machine with one w...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing mach...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
It is shown that (1) every context-free language is T(n) = n4-recognizable by a single-tape Turing m...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turin...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
Add to ORKG