Abstract
An alternating auxiliary pushdown hierarchy is defined by extending the machine model of the Logarithmic Alternation Hierarchy by a pushdown store while keeping a polynomial time bound. Although recently it was proven by Borodin et al. that the class of languages accepted by nondeterministic logarithmic space bounded auxiliary pushdown automata with a polynomial time bound is closed under complement [Bo et al], it is shown that, surprisingly, the further levels of this alternating auxiliary pushdown hierarchy coincide level by level with the Polynomial Hierarchy. Furthermore, it is shown that PSPACE can be characterized by simultaneously logarithmic space and polynomial time bounded auxiliary pushdown automata with unbounded alternation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
