A comparison of boundary graph grammars and context-free hypergraph grammars

This publication has 15 references indexed in Scilit:

• 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
• Combinatorial properties of boundary NLC graph languages
  Discrete Applied Mathematics, 1987
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
  Information and Control, 1986
• The NP-completeness column: an ongoing guide
  Journal of Algorithms, 1985
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Graph grammars with neighbourhood-controlled embedding
  Theoretical Computer Science, 1982
• On sequential and parallel node-rewriting graph grammars
  Computer Graphics and Image Processing, 1982
• On the structure of node-label-controlled graph languages
  Information Sciences, 1980
• Translations on a context free grammar
  Information and Control, 1971