Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence

DOI10.1007/3-540-61228-9_101zbMath1412.68107OpenAlexW2139693912MaRDI QIDQ4645290

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

zbMATH Keywords

graph grammarnode replacementexternal nodesentential formderivation step

Mathematics Subject Classification ID

Hypergraphs (05C65) Grammars and rewriting systems (68Q42)

Related Items (2)

Context-free hypergraph grammars with node rewriting ⋮ Node rewriting in graphs and hypergraphs: A categorical framework

Cites Work

• 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
• Formal languages of labelled graphs
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
• Handle-rewriting hypergraph grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence