Boundary NLC graph grammars--basic definitions, normal forms, and complexity
Information and Control
Some structural aspects of hypergraph languages generated by hyperedge replacement
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Linear graph grammars power and complexity
Information and Computation
Boundary graph grammars with dynamic edge relabeling
Journal of Computer and System Sciences
A comparison of boundary graph grammars and context-free hypergraph grammars
Information and Computation
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Nonterminal separation in graph grammars
Theoretical Computer Science
The string generating power of context-free hypergraph grammars
Journal of Computer and System Sciences
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Efficient Algorithms on Context-Free Graph Grammars
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
A Greibach Normal Form for Context-free Graph Grammars
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Polynomial Time Graph Grammars
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
May we introduce to you: hyperedge replacement
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Context-free Handle-rewriting Hypergraph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
On Hyperedge Replacement and BNLC Graph Grammars
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Context-Free NCE Graph Grammars
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Two types of hypergraph rewriting grammar are considered: the well-known context-free hypergraph grammar (or CFHG grammar, also known as hyperedge replacement system or HR system) and the more recent separated handle hypergraph grammar (or S-HH grammar). It is shown that every S-HH hypergraph language of bounded (hyper-)degree can be generated by a (separated) CFHG grammar. This implies that these two types of grammar generate the same class of graph languages of bounded degree, but incomparable classes of hypergraph languages.