Hyperedge Substitution in Basic Atom-Replacement Languages

Authors:
Renate Klempien-Hinrichs
Affiliations:
-
Venue:
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Year:
2002

Citing 7
Cited 1

Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
Context-free graph grammars

Handbook of formal languages, vol. 3
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
On Context-Free Languages

Journal of the ACM (JACM)
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

Graph Transformation Units --- An Overview

Concurrency, Graphs and Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce basic atom replacement in hypergraphs, which allows us to combine node-rewriting steps and hyperedge-rewriting steps within one type of grammar. The generated languages are closed under hyperedge substitution, thereby providing a structured way to build complex hypergraph languages from simple ones. In particular, there are basic atom-replacement languages which cannot be generated by any type of context-free hypergraph grammar.