Alternating automata on infinite objects, determinacy and Rabin's theorem

  • David Muller
  • Paul E. Schupp
Part III Automata On Infinite Trees
Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)


Computation Tree Winning Strategy Nondeterministic Automaton Infinite Tree Finite String 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A.K. Chandra D. Kozen and L. Stockmeyer, Alternation, J.A.C.M. 28 (1981), 114–133.Google Scholar
  2. 2.
    Y. Gurevich and L. Harrington, Trees, Automata and Games. Proc. ACM STOC May 1982, 60–65.Google Scholar
  3. 3.
    Y.N. Moschovakis, Descriptive Set Theory, North Holland. Amsterdam, 1980.Google Scholar
  4. 4.
    M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • David Muller
    • 1
  • Paul E. Schupp
    • 1
    • 2
  1. 1.University of IllinoisUSA
  2. 2.LITP, Université Paris VIIFrance

Personalised recommendations