Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
RAIRO-Theor. Inf. Appl., 23 1 (1989) 87-99
Published online: 2017-02-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Developments in Language Theory
Markus Holzer, Martin Kutrib and Ursula LeiterLecture Notes in Computer Science, Developments in Language Theory 6795 276 (2011)
https://doi.org/10.1007/978-3-642-22321-1_24
Formal Languages and Applications
Markus HolzerStudies in Fuzziness and Soft Computing, Formal Languages and Applications 148 227 (2004)
https://doi.org/10.1007/978-3-540-39886-8_12
NL-printable sets and Nondeterministic Kolmogorov Complexity
Eric AllenderElectronic Notes in Theoretical Computer Science 84 1 (2003)
https://doi.org/10.1016/S1571-0661(04)80838-7
Alternating and empty alternating auxiliary stack automata
Markus Holzer and Pierre McKenzieTheoretical Computer Science 299 (1-3) 307 (2003)
https://doi.org/10.1016/S0304-3975(02)00326-2
SIGACT news complexity theory column 35
Lane A. HemaspaandraACM SIGACT News 33 (1) 32 (2002)
https://doi.org/10.1145/507457.507465
Properties of probabilistic pushdown automata
Ioan I. Macarie and Mitsunori OgiharaTheoretical Computer Science 207 (1) 117 (1998)
https://doi.org/10.1016/S0304-3975(98)00059-0
Algorithms and Computations
Satyanarayana V. Lokam, Meena Mahajan and V. VinayLecture Notes in Computer Science, Algorithms and Computations 1004 52 (1995)
https://doi.org/10.1007/BFb0015408
Mathematical Foundations of Computer Science 1994
Klaus-Jörn Lange and Klaus ReinhardtLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1994 841 494 (1994)
https://doi.org/10.1007/3-540-58338-6_96
A very hard log-space counting class
Carme Álvarez and Birgit JennerTheoretical Computer Science 107 (1) 3 (1993)
https://doi.org/10.1016/0304-3975(93)90252-O
154 (1990)
https://doi.org/10.1109/SCT.1990.113964
Aspects and Prospects of Theoretical Computer Science
Klaus ReinhardtLecture Notes in Computer Science, Aspects and Prospects of Theoretical Computer Science 464 214 (1990)
https://doi.org/10.1007/3-540-53414-8_44