A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars

This publication has 23 references indexed in Scilit:

• The monadic second order logic of graphs VI: on several representations of graphs by relational structures
  Discrete Applied Mathematics, 1994
• The monadic second-order logic of graphs VII: graphs as relational structures
  Theoretical Computer Science, 1992
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
  RAIRO - Theoretical Informatics and Applications, 1992
• The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
  Theoretical Computer Science, 1991
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
  Theoretical Computer Science, 1987
• Graph expressions and graph rewritings
  Theory of Computing Systems, 1987
• Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
  Theoretical Computer Science, 1986
• Transductions and Context-Free Languages
  Published by Springer Nature ,1979
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960