Several properties of two-dimensional alternating Turing machines are investigated. The first part of this paper investigates the relationship between the classes of sets accepted by space-bounded and finitely leaf-size bounded three-way two-dimensional alternating Turing machines and the classes of sets which are finite intersections of sets accepted by space-bounded three-way two-dimensional nondeterministic Turing machines. The second part of this paper investigates the accepting power and closure properties (under Boolean operations) of two-dimensional alternating Turing machines with only universal states
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
Unambiguity in alternating Turing machines has received considerable attention in the context of ana...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
Several properties of two-dimensional alternating Turing machines are investigated. The first part o...
AbstractThis paper introduces a two-dimensional alternating Turing machine (2-ATM) which can be cons...
AbstractLet L[AONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line T...
AbstractThis paper introduces a simple, natural complexity measure for space bounded two-dimensional...
AbstractThis paper investigates the accepting powers of nondeterministic and alternating 1-inkdot Tu...
AbstractWe show that n log n space is sufficient for three-way nondeterministic Turing machines (3NT...
AbstractThis note supplements a result of Inoue and Takanami (1980) who showed that for any function...
The different concepts involved in “reversal complexity”counting reversals (sweeps), visits to a squ...
We say that a Turing machine has periodic support if there is an infinitely repeated word to the lef...
Recently, the property of unambiguity in alternating Turing machines has received considerable atten...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
AbstractWhether or not there is a difference of the power among alternating Turing machines with a b...
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
Unambiguity in alternating Turing machines has received considerable attention in the context of ana...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
Several properties of two-dimensional alternating Turing machines are investigated. The first part o...
AbstractThis paper introduces a two-dimensional alternating Turing machine (2-ATM) which can be cons...
AbstractLet L[AONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line T...
AbstractThis paper introduces a simple, natural complexity measure for space bounded two-dimensional...
AbstractThis paper investigates the accepting powers of nondeterministic and alternating 1-inkdot Tu...
AbstractWe show that n log n space is sufficient for three-way nondeterministic Turing machines (3NT...
AbstractThis note supplements a result of Inoue and Takanami (1980) who showed that for any function...
The different concepts involved in “reversal complexity”counting reversals (sweeps), visits to a squ...
We say that a Turing machine has periodic support if there is an infinitely repeated word to the lef...
Recently, the property of unambiguity in alternating Turing machines has received considerable atten...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
AbstractWhether or not there is a difference of the power among alternating Turing machines with a b...
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
Unambiguity in alternating Turing machines has received considerable attention in the context of ana...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...