Node rewriting in graphs and hypergraphs: A categorical framework
From MaRDI portal
Publication:5958766
DOI10.1016/S0304-3975(00)00200-0zbMath0989.68064OpenAlexW2030523904MaRDI QIDQ5958766
Hélène Jacquet, Michel Bauderon
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00200-0
Related Items (5)
Pullback Grammars Are Context-Free ⋮ Hypermap rewriting: A combinatorial approach ⋮ The PBPO graph transformation approach ⋮ GETGRATS ⋮ Node rewriting in graphs and hypergraphs: A categorical framework
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- 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
- Handle-rewriting hypergraph grammars
- Graph expressions and graph rewritings
- Kronecker Products and Local Joins of Graphs
- A category-theoretical approach to vertex replacement: The generation of infinite graphs
- The category of typed graph grammars and its adjunctions with categories of derivations
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence
- Node rewriting in graphs and hypergraphs: A categorical framework
This page was built for publication: Node rewriting in graphs and hypergraphs: A categorical framework
