Context-free hypergraph grammars with node rewriting
Renate Klempien-Hinrichs · Electronic Notes in Theoretical Computer Science · 2002
The generalisation of confluent node rewriting, a context-free graph grammar approach, to hypergraphs yields the most powerful known context-free technique to define hypergraph languages. This paper, which summarises part of the author's doctoral thesis, substantiates that claim by reporting on the generative power of the so-called C-hNCE grammars.