Context-free Handle-rewriting Hypergraph Grammars

@inproceedings{Courcelle1990ContextfreeHH,
  title={Context-free Handle-rewriting Hypergraph Grammars},
  author={Bruno Courcelle and Joost Engelfriet and Grzegorz Rozenberg},
  booktitle={Graph-Grammars and Their Application to Computer Science},
  year={1990}
}
Separated handle-rewriting hypergraph grammars (S-HH grammars) are introduced, where separated means that the nonterminal handles are disjo int . S-HH grammars have the same graph generating power as the vertex rewriting context-free NCE graph grammars, and as recursive systems of equations with four types of simple operations on graphs. 

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…