The definability of equational graphs in monadic second-order logic

  • B. Courcelle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 372)


We establish that every equational graph can be characterized, up to isomorphism, by a formula of monadic second-order logic. It follows that the isomorphism of two equational graphs is decidable. Equational graphs can be used to describe the behaviour of recursive applicative program schemes. We obtain a sufficient and decidable condition for the equivalence of these program schemes.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    ADAMEK J.,KOUBEK V.,Least fixed point of a functor, J.Comput.System Sci. 19 (1979) 163–178.CrossRefGoogle Scholar
  2. [2]
    BAUDERON M., On systems of equations defining infinite graphs, Lec.Notes Computer Science 344, (1989) 54–73.Google Scholar
  3. [3]
    BAUDERON M., COURCELLE B.,Graph expressions and graph rewritings, Mathematical System Theory 20 (1987) 83–127.CrossRefGoogle Scholar
  4. [4]
    BÜCHI J.,Weak second-order logic and finite automata, Z. Math.Logik Grundlagen Math. 5 (1960) 66–92.Google Scholar
  5. [5]
    COURCELLE B.,An axiomatic approach to the Korenjak-Hopcroft algorithms,Math.Systems Theory 16 (1983) 191–231.CrossRefGoogle Scholar
  6. [6]
    COURCELLE B., Fundamental properties of infinite trees, Theor.Comp. Sci. 25 (1983) 95–169.CrossRefGoogle Scholar
  7. [7]
    COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor.Comp.Sci. 42 (1986), 1–122.CrossRefGoogle Scholar
  8. [8]
    COURCELLE B., The monadic second-order logic of graphs, I: Recognizable sets of finite graphs, Research report 8837 Bordeaux I University, 1988. To appear in Information and Computation.Google Scholar
  9. [9]
    COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoretical Computer Science 55 (1987) 141–181.CrossRefGoogle Scholar
  10. [10]
    COURCELLE B., A representation of graphs by algebraic expressions and its use for graph rewriting systems, Proc. of the 3rd international workshop on graph grammars, Lec.Notes Computer Sci.291 (1987), pp.112–132.Google Scholar
  11. [11]
    COURCELLE B.,On the use of context-free graph grammars for analysing recursive definitions, in "Programming of Future Generation Computers II", L. Kott and K. Fuchi eds., Elsevier, Amsterdam 1988, pp.83–122.Google Scholar
  12. [12]
    COURCELLE B., The monadic second-order logic of graphs, II: Infinite graphs of bounded width, to appear in Mathematical Systems Theory.Google Scholar
  13. [13]
    COURCELLE B., The monadic second-order logic of graphs: Definable sets of finite graphs, Workshop on Graph Theoretical Concepts in Computer Science, Lec. Notes Computer Sci. 344 (1989) 30–53.Google Scholar
  14. [14]
    COURCELLE B., Recursive applicative program schemes, in "Handbook of Theoretical Computer Science" J.Van Leeuwen ed.,Elsevier, to appear.Google Scholar
  15. [15]
    COURCELLE B., The monadic second-order logic of graphs III: Tree-width,Forbidden Minors,and Complexity issues, Research report 8852,submitted for publication.Google Scholar
  16. [16]
    COURCELLE B., The monadic second-order logic of graphs IV: Every equational graph is definable,Report 8830, submitted for publication.Google Scholar
  17. [17]
    GUESSARIAN I., Algebraic Semantics, Lec.Notes Computer Sci., 99,1981.Google Scholar
  18. [18]
    RABIN M., Decidability of 2nd-order theories and automata on infinite trees, Trans. of Amer. Math. Soc. 141 (1969) 1–35.Google Scholar
  19. [19]
    RABIN M., Automata on infinite objects and Church's Problem, A.M.S., Regional Conference Series in Mathematics, vol 13, 1972.Google Scholar
  20. [20]
    RABIN M., Weakly definable relations and special automata in "Mathematical Logic and Foundations of set Theory, Bar-Hillel ed., North-Holland, 1972, pp.1–23.Google Scholar
  21. [21]
    THOMAS W.,Automata on infinite objects, same volume as [14].Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • B. Courcelle
    • 1
  1. 1.Laboratoire d'InformatiqueUniversité Bordeaux ITalenceFrance

Personalised recommendations