Abstract and concrete categories
Abstract and concrete categories
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Node replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Node rewriting in graphs and hypergraphs: a categorical framework
Theoretical Computer Science
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
A Uniform Approach to Graph Rewriting: The Pullback Approach
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Pullback Grammars Are Context-Free
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Hi-index | 0.00 |
We define generic categorical notions of rewriting and grammar, using two basic operations, pullback and pushout, and show that these categorical grammars are intrinsically context-free in the sense of Courcelle. We then specialise to various settings, including classical word grammars, hyperedge replacement grammars or node-replacement grammars. We show that some languages which are classical counter-example to context-freeness become context-free within this new framework.