AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes and time complexity T can be simulated by an alternating Turing machine with linear tapes that runs in time O(Tlog T). We extend their result to multidimensional Turing machines. We show that every deterministic Turing machine with d-dimensional tapes and time complexity T can be simulated by an alternating Turing machine with linear tapes that runs in time O(T(log T)1d
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
We investigate the relationship between the time and the reversal complexity measure for determinist...
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 all d ⩾ 1 and all e >d, every deterministic multihead e-dimensional Turing machine of ti...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
We investigate the relationship between the time and the reversal complexity measure for determinist...
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 all d ⩾ 1 and all e >d, every deterministic multihead e-dimensional Turing machine of ti...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
Abstract. Deterministic k-tape and multitape Turing machines with one-way, twoway and without a sepa...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
DOI
Add to ORKG