AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional tape, one can effectively construct a Turing machineM′withkd-dimensional tapes but only one head per tape and one additional linear single-head tape which simulatesMin linear-time
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
AbstractFor all d ⩾ 1 and all e >d, every deterministic multihead e-dimensional Turing machine of ti...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
This paper deals with parallel Turing machines with multi-head control units on one or more ta...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
AbstractFor all d ⩾ 1 and all e >d, every deterministic multihead e-dimensional Turing machine of ti...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
This paper deals with parallel Turing machines with multi-head control units on one or more ta...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
DOI
Add to ORKG