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

  • David E. Muller
  • Ahmed Saoudi
  • Paul E. Schupp
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


Transition Function Acceptance Condition Testing Track Simulation Track Individual History 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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. 4.
    M.O. Rabin, Weakly definable relations and special automata, Math. Logic and Foundations of Set Theory, North-Holland. 1972, 1–23.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • David E. Muller
    • 1
  • Ahmed Saoudi
    • 2
  • Paul E. Schupp
    • 3
  1. 1.University of Illinois, University of TexasUSA
  2. 2.Université Paris 13USA
  3. 3.University of Illinois, Université Paris 7USA

Personalised recommendations