Elsevier

Information and Computation

Volume 84, Issue 2, February 1990, Pages 163-206
Information and Computation

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

https://doi.org/10.1016/0890-5401(90)90038-JGet rights and content
Under an Elsevier user license
open archive

Abstract

Context-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree have the same power, both for generating sets of graphs and for generating sets of hypergraphs. Arbitrary boundary graph grammars have more graph generating power than context-free hypergraph grammars, but they have the same hypergraph generating power. To obtain these results, several normal forms for boundary graph grammars are given. It is also shown that the class of boundary graph languages is closed under the operation of edge contraction, where the label of the edge indicates whether or not the edge should be contracted.

Cited by (0)