Alternating and empty alternating auxiliary stack automata

Authors:
Markus Holzer;Pierre McKenzie
Affiliations:
Institut für Informatik, Technische Universität München, Arcisstraße 21, D-80290 München, Germany;Département d'IRO, Université de Montréal, C.P. 6128, succ. Centre-Ville, Montréal (Québec), H3C 3J7 Canada
Venue:
Theoretical Computer Science
Year:
2003

Citing 11
Cited 3

Structural complexity 1

Structural complexity 1
The method of forced enumeration for nondeterministic automata

Acta Informatica
Nondeterministic space is closed under complementation

SIAM Journal on Computing
Bounded query classes

SIAM Journal on Computing
One-way stack automata

Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Empty Alternation

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Two remarks on the power of counting

Proceedings of the 6th GI-Conference on Theoretical Computer Science

The complexity of chromatic strength and chromatic edge strength

Computational Complexity
On Models of a Nondeterministic Computation

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Nodes connected by path languages

DLT'11 Proceedings of the 15th international conference on Developments in language theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, PSpace, and bounded query classes like co-DP=NL〈NP[1]〈 and Θ2P=PNP[O(logn)], in a uniform framework.