Node rewriting in hypergraphs
From MaRDI portal
Recommendations
Cites work
- A category-theoretical approach to vertex replacement: the generation of infinite graphs
- A comparison of boundary graph grammars and context-free hypergraph grammars
- A uniform approach to graph rewriting: The pullback approach
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Graph expressions and graph rewritings
- Graph grammars with neighbourhood-controlled embedding
- Handle-rewriting hypergraph grammars
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Kronecker Products and Local Joins of Graphs
- Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
- On hyperedge replacement and BNLC graph grammars
- On the structure of node-label-controlled graph languages
This page was built for publication: Node rewriting in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550530)