Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
From MaRDI portal
Publication:4645290
DOI10.1007/3-540-61228-9_101zbMATH Open1412.68107OpenAlexW2139693912MaRDI QIDQ4645290FDOQ4645290
Authors: Renate Klempien-Hinrichs 
Publication date: 10 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61228-9_101
Recommendations
Cites Work
- Hyperedge replacement: grammars and languages
- Handle-rewriting hypergraph grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal languages of labelled graphs
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
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
- Title not available (Why is that?)
- Node replacement graph languages squeezed with chains, trees, and forests
- Node rewriting in hypergraphs
- Title not available (Why is that?)
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)
