Separated handle-rewriting hypergraph grammars (S-HH grammars) are introduced, where separated means that the nonterminal handles are disjoint. 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.
CITATION STYLE
Courcelle, B., Engelfriet, J., & Rozenberg, G. (1991). Context-free handle-rewriting hypergraph grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 253–268). Springer Verlag. https://doi.org/10.1007/BFb0017394
Mendeley helps you to discover research relevant for your work.