Normal forms for context-free node-rewriting hypergraph grammars

Authors:
Renate Klempien-Hinrichs
Affiliations:
Universitä/t Bremen, Fachbereich Mathematik&sol/Informatik, Postfach 33 04 40, 28334 Bremen, Germany/ Email: rena@informatik.uni-bremen.de
Venue:
Mathematical Structures in Computer Science
Year:
2002

Citing 11
Cited 1

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

Information and Computation
The monadic second-order logic of graphs VII: graphs as relational structures

Theoretical Computer Science - Special issue on logic and applications to computer science
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
Emptiness problems of eNCE graph languages

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Logical description of context-free graph languages

Journal of Computer and System Sciences
Node replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Hyperedge replacement graph grammars

Handbook of graph grammars and computing by graph transformation
HRNCE grammars - a hypergraph generating system with an eNCE way of rewriting

Theoretical Computer Science
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Node Replacement in Hypergrahps: Simulation of Hyperedge Replacement, and Decidability of Confluence

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
May we introduce to you: hyperedge replacement

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science

A local greibach normal form for hyperedge replacement grammars

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Confluent node-rewriting hypergraph grammars represent the most comprehensive known method for defining sets of hypergraphs in a recursive way. For a large natural subclass of these grammars, we show that the maximal rank of hyperedges indispensable for generating some set of hypergraphs equals the maximal rank of the hyperedges occurring in the hypergraphs of that set. Moreover, if such a grammar generates a set of graphs, one can construct from that grammar a C-edNCE graph grammar generating the same set of graphs.