Cited By
View all- Xu JYoshinaga TInoue KWang YIto A(2001)Alternation for sublogarithmic space-bounded alternating pushdown automataTheoretical Computer Science10.5555/2780702.2781109259:1(475-492)Online publication date: 28-May-2001
This paper investigates the accepting powers of two-way alternating Turing machines (2ATM's) with only existential (universal) states which have inkdots and sublogarithmic space. It is shown that for sublogarithmic space-bounded computations, (i) multi-...
This paper investigates some aspects of the accepting powers of deterministic, nondeterministic, and alternating one-pebble Turing machines with spaces between log log n and log n. We first investigate a relationship between the accepting powers of two-...
Deterministic one-way Turing machines with sublinear space bounds are systematically studied. We distinguish among the notions of strong, weak, and restricted space bounds. The latter is motivated by the study of P automata. The space available on the ...
Elsevier North-Holland, Inc.
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in