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)
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated inp...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractLet L be a language recognized by a nondeterministic d-dimensional Turing machine with one w...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated inp...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractLet L be a language recognized by a nondeterministic d-dimensional Turing machine with one w...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
DOI
Add to ORKG