The alternating variant of the shrinking two-pushdown automaton of Buntrock and Otto (1998) is introduced. It is shown that the class of languages accepted by these automata is contained in the class of deterministic context-sensitive languages, and that it contains a PSPACE-complete language. Hence, the closure of this class of languages under log-space reductions coincides with the complexity class PSPACE.
|Number of pages||8|
|Journal||IEICE Transactions on Information and Systems|
|Publication status||Published - 2004 Apr|
- Two-pushdown automaton
ASJC Scopus subject areas
- Information Systems
- Computer Graphics and Computer-Aided Design