6 found
Sort by:
Disambiguations:
Bruno Courcelle [3]B. Courcelle [3]
  1.  3 DLs
    B. Courcelle (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press.
    Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index.
    Direct download  
     
    My bibliography  
     
    Export citation  
  2.  1 DLs
    Bruno Courcelle & Igor Walukiewicz (1998). Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Annals of Pure and Applied Logic 92 (1):35-62.
    We prove that every monadic second-order property of the unfolding of a transition system is a monadic second-order property of the system itself. An unfolding is an instance of the general notion of graph covering. We consider two more instances of this notion. A similar result is possible for one of them but not for the other.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3.  0 DLs
    J. Avigad, B. Courcelle, I. Walukiewicz, D. W. Cunningham, T. Fernando, M. Forti & F. Honaell (1998). Hjorth, G., Kechris, AS and Louveau, A., Bore1 Equivalence. Annals of Pure and Applied Logic 92:297.
    No categories
     
    My bibliography  
     
    Export citation  
  4.  0 DLs
    B. Courcelle, B. Domolki, T. Gergely, J. W. de Bakker, J. I. Zucker & E. Engeler (1984). Equational Theories and Equivalences of Programs. Journal of Symbolic Logic 49 (3):990-991.
    Direct download  
     
    My bibliography  
     
    Export citation  
  5.  0 DLs
    Bruno Courcelle (1995). The Monadic Second-Order Logic of Graphs VIII: Orientations. Annals of Pure and Applied Logic 72 (2):103-143.
    In every undirected graph or, more generally, in every undirected hypergraph of bounded rank, one can specify an orientation of the edges or hyperedges by monadic second-order formulas using quantifications on sets of edges or hyperedges. The proof uses an extension to hypergraphs of the classical notion of a depth-first spanning tree. Applications are given to the characterization of the classes of graphs and hypergraphs having decidable monadic theories.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6.  0 DLs
    Bruno Courcelle (1990). The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational graphs11This Work has Been Supported by the “Programme de Recherches Coordonnées: Mathématiques Et Informatique”, and by the ESPRIT-Basic Research Action Contract No. 3299, “Computing by Graph Transformations”. [REVIEW] Annals of Pure and Applied Logic 49 (3):193-255.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation