Automata, games, and positive monadic theories of trees

  • Michel Parigot
Session 1 Automata And Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)


The present paper uses a game theoretic approach to make a fine study of the monadic theory of the infinite binary tree. We characterize some natural classes of monadic formulas in terms of alternating automata; in particular we give a hierarchy of automata corresponding to the hierarchy of alternation of quantifiers for weak monadic formulas. These characterizations lead to efficient decision procedures.


Computation Tree Winning Strategy Tree Language Boolean Combination Game Theoretic Approach 
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.

Unable to display preview. Download preview PDF.


  1. [1]
    J.R. BUCHI, Using determinancy of games to eliminate quantifiers, Lecture Notes in Computer Science, vol. 56, Springer, 1977, pp. 367–378.Google Scholar
  2. [2]
    J.R. BUCHI, State-strategies for games in F σδ ∩ G δσ, Journal of Symbolic Logic, vol. 48 (1983), pp. 1171–1198.Google Scholar
  3. [3]
    Y. GUREVICH and L. HARRINGTON, Trees, automata and games, 14th Symposium on Theory of Computing (1982), pp. 60–65.Google Scholar
  4. [4]
    D.A. MARTIN, Borel determinancy, Annals of Mathematics, vol. 102 (1975), pp. 363–371.Google Scholar
  5. [5]
    Y.N. MOSCHOVAKIS, Descriptive set theory, North-Holland, 1980.Google Scholar
  6. [6]
    D.E. MULLER and P.E. SCHUPP, Alternating automata on infinite objects, determinacy and Rabin's theorem, Lecture Notes in Computer Science, vol. 192, Springer, 1985, pp. 100–107.Google Scholar
  7. [7]
    D.E. MULLER, A. SAOUDI, and P.E. SCHUPP, Alternating automata, the weak monadic theory of the tree, and its complexity, Proceedings ICALP 1986.Google Scholar
  8. [8]
    M. PARIGOT, Automata as modal operators, preprint.Google Scholar
  9. [9]
    M.O. RABIN, Decidability of second order theories and automata on infinite trees, Transations A.M.S., vol. 141 (1969), pp. 1–35.Google Scholar
  10. [10]
    M.O. RABIN, Weakly definable relations and special automata, Mathematical Logic and Foundations of Set Theory, North Holland, 1970, pp. 1–23.Google Scholar
  11. [11]
    W. THOMAS, A hierarchy of sets of infinite trees Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Michel Parigot
    • 1
  1. 1.Equipe de Logique, CNRS UA 753Université Paris 7, UFR de MathématiquesParis Cedex 05

Personalised recommendations