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
AbstractWe shall show that, for each nondeterministic single-tape Turing machine M of time complexit...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated inp...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
AbstractIn this paper we study diagonal processes over time bounded computations of one-tape Turing ...
Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages ...
AbstractThe time separation results concerning classes of languages over a single-letter alphabet ac...
AbstractWe shall show that, for each nondeterministic single-tape Turing machine M of time complexit...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated inp...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
AbstractIn this paper we study diagonal processes over time bounded computations of one-tape Turing ...
Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages ...
AbstractThe time separation results concerning classes of languages over a single-letter alphabet ac...
AbstractWe shall show that, for each nondeterministic single-tape Turing machine M of time complexit...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
DOI
Add to ORKG