Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)
Alternating automata on infinite objects, determinacy and Rabin's theorem
KeywordsComputation Tree Winning Strategy Nondeterministic Automaton Infinite Tree Finite String
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.A.K. Chandra D. Kozen and L. Stockmeyer, Alternation, J.A.C.M. 28 (1981), 114–133.Google Scholar
- 2.Y. Gurevich and L. Harrington, Trees, Automata and Games. Proc. ACM STOC May 1982, 60–65.Google Scholar
- 3.Y.N. Moschovakis, Descriptive Set Theory, North Holland. Amsterdam, 1980.Google Scholar
- 4.M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.Google Scholar
© Springer-Verlag Berlin Heidelberg 1985