About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Information and Control
Paper
Alternation bounded auxiliary pushdown automata
Abstract
Languages accepted by alternating auxiliary pushdown automata using simultaneously a(n) alternations and s(n) space are shown to be members of the class of languages accepted by nondeterministic Turing machines using a(n) 2es(n) space for some c > 0. This result is used to show that the hierarchy of classes of languages accepted by pushdown automata based on the number of alternations collapses at the second level of the hierarchy. The power of alternation bounded pushdown automata without auxiliary storage is also investigated. © 1984 Academic Press, Inc.