AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾ 2 we exhibit infinite hierarchies of languages recognizable by k-tape machines with machines with increasing amount of time on the same amount of space
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages ...
AbstractIn STOC 1993, Jones showed the existence of a hierarchy within problems decidable in linear ...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractThe time separation results concerning classes of languages over a single-letter alphabet ac...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
Nepomnjaščǐı’s Theorem states that for all 0 ≤ < 1 and k> 0 the class of languages recogn...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
AbstractThe main tool to obtain a tight deterministic time hierarchy for Turing machines is a new da...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages ...
AbstractIn STOC 1993, Jones showed the existence of a hierarchy within problems decidable in linear ...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractThe time separation results concerning classes of languages over a single-letter alphabet ac...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
Nepomnjaščǐı’s Theorem states that for all 0 ≤ < 1 and k> 0 the class of languages recogn...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
AbstractThe main tool to obtain a tight deterministic time hierarchy for Turing machines is a new da...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages ...
AbstractIn STOC 1993, Jones showed the existence of a hierarchy within problems decidable in linear ...
DOI
Add to ORKG