Abstract
Auxiliary pushdown automata have been proven to be a useful tool for the characterization of complexity classes. In this paper we consider the pushdown reversal complexity of these machines, and show that especially in connection with a simultaneous space bound, pushdown reversals provide a uniform measure for the characterization of awide range of complexity classes, located between L and P. It is shown that classes defined by reversal bounds are included in those of restricted pushdown height.
Moreover, the connection between alternating Turing machines (ATMs) and auxiliary pushdown automata (AuxPDAs) is investigated. Applying a technique recently introduced by Neil Immerman and Róbert Szelepcsényi we can generalize a relation shown by Walter Ruzzo which connects the tree-size of ATMs to time of AuxPDAs. Namely we shown that the number of reversals coincides with the alternation-size of and ATM, which is the total number of alternations occurring in an accepting computation tree. Several corollaries relating time and tree-size of ATMs to pushdown height and reversals of AuxPDAs are derived.
...!pyramid!tub!gerhard
...!pyramid!tub!albrecht
A preliminary version: On Reversal Complexity of Auxiliary Pushdown Automata is contained in the unpublished volume: “Dirk Siefkes zum 50. Geburtstag”, Technische Universität Berlin / Universität Augsburg, Klaus W. Wagner ed., pp. 4–16, April 16, 1988
Preview
Unable to display preview. Download preview PDF.
5. References
Ashok K. Chandra, Dexter C. Kozen, Larry J. Stockmeyer: Alternation, “Journal of the Association for Computing Machinery 28”, 114–133, 1981
Jian-er Chen, Chee-Keng Yap: Reversal Complexity, “2nd Structure in Complexity Theory”, IEEE, 14–19, 1987
Stephen A. Cook: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, “Journal of the Association for Computing Machinery 18”, No. 1, 4–18, 1971
John E. Hoperoft, Jeffrey D. Ullman: “Introduction to Automata Theory, Languages, and Computation”, Addison-Wesley, 1979
Neil Immerman: Nondeterministic Space is Closed Under Complement, “3rd Structure in Complexity Theory”, IEEE, 1988
N.K. King: Measures of Parallelism in Alternating Computation Trees, “13th Annual ACM Symposium on Theory of Computing (STOC)”, 189–201, 1981
George Mager: Writing Pushdown Acceptors, “Journal of Computer and System Science 3”, 233–247, 1969
Walter L. Ruzzo: Tree-Size Bounded Alternation, “Journal of Computer and System Science 21”, 218–235, 1980
Walter L. Ruzzo: On Uniform Circuit Complexity, “Journal of Computer and System Science 22”, 365–383, 1981
Ivan Hal Sudborough: On the Tape Complexity of Deterministic Context-Free Languages, “Journal of the Association for Computing Machinery 25”, No 3, 405–414, 1978
Róbert Szelepcsényi: The Method of Forcing for Nondeterministic Automata, “Bulletin of the EATCS 33”, 96–100, 1987
Gerd Wechsung: The Oscillation Complexity and a Hierarchy of Context-Free Languages, “2nd International Conference on Fundamentals of Computation Theory”, Akademie-Verlag, Berlin, DDR, 508–515 (1979)
Klaus W. Wagner, Gerd Wechsung: “Computational Complexity”, Reidel Verlag, Dordrecht, 1986 and VEB Deutscher Verlag der Wissenschaften, 1986
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buntrock, G., Hoene, A. (1989). Reversals and alternation. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028986
Download citation
DOI: https://doi.org/10.1007/BFb0028986
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive