Some observations concerning alternating Turing machines using small space
Information Processing Letters
Space bounded computations: review and new separation results
MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Nondeterministic computations in sublogarithmic space and space constructibility
SIAM Journal on Computing
A note on multi-inkdot nondeterministic Turing machines with small space
Information Processing Letters
On 1-inkdot alternating Turing machines with small space
Theoretical Computer Science
The Sublogarithmic Alternating Space World
SIAM Journal on Computing
Journal of the ACM (JACM)
Alternation for sublogarithmic space-bounded alternating pushdown automata
Theoretical Computer Science
Turing Machines with Sublogarithmic Space
Turing Machines with Sublogarithmic Space
Hi-index | 0.00 |
1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input (with an inkdot) once. This paper investigates the closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) states, and shows, for example, that for any function L(n) such that L(n) ≥ log log n and L(n) = o(log n), the class of sets accepted by weakly (strongly) L(n) space-bounded 1-inkdot two-way alternating pushdown automata with only existential (universal) states is not closed under concatenation with regular sets, length-preserving homomorphism, and Kleene closure.