Iterated stack automata and complexity classes

https://doi.org/10.1016/0890-5401(91)90015-TGet rights and content
Under an Elsevier user license
open archive

Abstract

An iterated pushdown is a pushdown of pushdowns of … of pushdowns. An iterated exponential function is 2 to the 2 to the … to the 2 to some polynomial. The main result presented here is that the nondeterministic 2-way and multi-head iterated pushdown automata characterize the deterministic iterated exponential time complexity classes. This is proved by investigating both nondeterministic and alternating auxiliary iterated pushdown automata, for which similar characterization results are given. In particular it is shown that alternation corresponds to one more iteration of pushdowns. These results are applied to the 1-way iterated pushdown automata: (1) they form a proper hierarchy with respect to the number of iterations, and (2) their emptiness problem is complete in deterministic iterated exponential time. Similar results are given for iterated stack (checking stack, nonerasing stack, nested stack, checking stack-pushdown) automata.

Cited by (0)