Abstract. Following the recent independent proofs of Immerman [SLAM J. Comput., 17 (1988) given. Then it is shown that the class LOGCFL is closed under complementation. The latter is a special case of a general result that shows closure under complementation of classes defined by semi-unbounded fan-in circuits (or, equivalently, nondeterministic auxiliary pushdown automata or tree-size bounded alternating Turing machines). As one consequence, it is shown that small numbers of "role switches" in two-person pebbling can be eliminated.

We present a randomized parallel algorithm for constructing

No abstract

No abstract

No abstract