Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas

  • Bruno Courcelle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1631)


A context-free grammar specifies a set of words, and for each of these words one or more derivation trees. Such a tree represents the (or a) hierarchical structure of the corresponding word and is the input of algorithms like those used in a compiler.


Bipartite Graph Linear Order Graph Transformation Logical Formula Graph Property 
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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Bruno Courcelle
    • 1
  1. 1.LaBRIUniversité Bordeaux ITalenceFrance

Personalised recommendations