Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)
Alternating automata, the weak monadic theory of the tree, and its complexity
KeywordsTransition Function Acceptance Condition Testing Track Simulation Track Individual History
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.D.E. Muller and P.E. Schupp, The theory of ends. pushdown automata and second-order logic, Theoretical Computer Science 37, (1985).Google Scholar
- 2.D.E. Muller and P.E. Schupp, Alternating automata on infinite objects and Rabin's theorem, submitted to Theoretical Computer Science.Google Scholar
- 3.M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.Google Scholar
- 4.M.O. Rabin, Weakly definable relations and special automata, Math. Logic and Foundations of Set Theory, North-Holland. 1972, 1–23.Google Scholar
© Springer-Verlag Berlin Heidelberg 1986