AbstractLet L[AONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line Turing machines, and L[UONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line Turing machines with only universal states. This note first shows that, for any L(n) such that L(n) ⩾ log log n and limn → ∞[L(n)/log n] = 0, (i) L[UONTM(L(n))] ⊋ L[AONTM(L(n))], (ii) L[UONTM(L(n))] is not closed under complementation, and (iii) L[UONTM(L(n))] is properly contained in the class of sets accepted by L(n) space bounded alternating Turing machines with only universal states. We then show that there exists an infinite hierarchy among L[UONTM(L(n))]'s with log log n ⩽ L(n) ⩽ log n
AbstractOne of the most important questions in the theory of computational complexity is whether non...
AbstractWhether or not there is a difference of the power among alternating Turing machines with a b...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
AbstractLet L[AONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line T...
AbstractThis paper investigates the accepting powers of nondeterministic and alternating 1-inkdot Tu...
Several properties of two-dimensional alternating Turing machines are investigated. The first part o...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
We show that one-way Π2-alternating Turing machines cannot accept unary nonregular languages in o(lo...
In this work we study classes of languages accepted by finitely ambiguous space bounded automata whi...
AbstractThis paper introduces a simple, natural complexity measure for space bounded two-dimensional...
We prove a tight log n lower bound on middle space for one-way alternating Turing machines that acce...
AbstractWe continue the study of the computational power of synchronized alternating Turing machines...
AbstractTuring machines are considered as recognizers of sets of infinite (ω-type) sequences, so cal...
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
AbstractOne of the most important questions in the theory of computational complexity is whether non...
AbstractWhether or not there is a difference of the power among alternating Turing machines with a b...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
AbstractLet L[AONTM(L(n))] be the class of sets accepted by L(n) space bounded alternating on-line T...
AbstractThis paper investigates the accepting powers of nondeterministic and alternating 1-inkdot Tu...
Several properties of two-dimensional alternating Turing machines are investigated. The first part o...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
We show that one-way Π2-alternating Turing machines cannot accept unary nonregular languages in o(lo...
In this work we study classes of languages accepted by finitely ambiguous space bounded automata whi...
AbstractThis paper introduces a simple, natural complexity measure for space bounded two-dimensional...
We prove a tight log n lower bound on middle space for one-way alternating Turing machines that acce...
AbstractWe continue the study of the computational power of synchronized alternating Turing machines...
AbstractTuring machines are considered as recognizers of sets of infinite (ω-type) sequences, so cal...
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
AbstractOne of the most important questions in the theory of computational complexity is whether non...
AbstractWhether or not there is a difference of the power among alternating Turing machines with a b...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...