Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
From MaRDI portal
Publication:4645290
Recommendations
Cites work
- scientific article; zbMATH DE number 3943061 (Why is no real title available?)
- scientific article; zbMATH DE number 4051027 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- 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
- Formal languages of labelled graphs
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Handle-rewriting hypergraph grammars
- Hyperedge replacement: grammars and languages
Cited in
(8)- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Node rewriting in graphs and hypergraphs: A categorical framework
- Context-free hypergraph grammars with node rewriting
- Hyperedge replacement with rendezvous
- scientific article; zbMATH DE number 1504831 (Why is no real title available?)
- Node replacement graph languages squeezed with chains, trees, and forests
- scientific article; zbMATH DE number 1762783 (Why is no real title available?)
- Node rewriting in hypergraphs
This page was built for publication: Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645290)
