A comparison of boundary graph grammars and context-free hypergraph grammars
Information and Computation
Category theory for computing science
Category theory for computing science
Infinite hypergraphs I. basic properties
Theoretical Computer Science
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Categories, types, and structures: an introduction to category theory for the working computer scientist
Infinite hypergraphs: ii. systems of recursive equations
Theoretical Computer Science
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
On hyperedge replacement and BNLC graph grammars
Discrete Applied Mathematics
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
HRNCE Grammars - A Hypergraph Generating System with an eNCE Way
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
The Category of Typed Graph Grammars and its Adjunctions with Categories
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
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
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Graph grammars with node-label controlled rewriting and embedding
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
A Uniform Approach to Graph Rewriting: The Pullback Approach
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
The Kronecker Product and Local Computations in Graphs
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Pullback Grammars Are Context-Free
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Context-Free Categorical Grammars
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
| Hi-index | 5.23 |
Vertex rewriting in graphs is a very powerful mechanism which has been studied for quite a long time. In this paper we eventually provide a categorical theory of vertex rewriting and show how it can extend in a uniform way to node and pattern rewriting mechanisms in hypergraphs. Copyright 2001 Elsevier Science B.V.