Skip to main content
Conference Proceedings

Alternating automata, the weak monadic theory of the tree, and its complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1986) 226 LNCS 275-283
DOI: 10.1007/3-540-16761-7_77
90Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Muller, D. E., Saoudi, A., & Schupp, P. E. (1986). Alternating automata, the weak monadic theory of the tree, and its complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 226 LNCS, pp. 275–283). Springer Verlag. https://doi.org/10.1007/3-540-16761-7_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free