A uniform approach to graph rewriting: The pullback approach
From MaRDI portal
Publication:6122215
DOI10.1007/3-540-60618-1_69OpenAlexW1565694481MaRDI QIDQ6122215
Publication date: 28 February 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60618-1_69
Related Items (1)
Cites Work
- A comparison of boundary graph grammars and context-free hypergraph grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- On the structure of node-label-controlled graph languages
- Graph grammars with neighbourhood-controlled embedding
- Infinite hypergraphs. II: Systems of recursive equations
- On hyperedge replacement and BNLC graph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Infinite hypergraphs. I: Basic properties
- Graph expressions and graph rewritings
- Kronecker Products and Local Joins of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A uniform approach to graph rewriting: The pullback approach
