Context-free hypergraph grammars with node rewriting

DOI10.1016/S1571-0661(04)80203-2zbMath1263.68081MaRDI QIDQ4923541

Renate Klempien-Hinrichs

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

GETGRATS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• The generative power of context-free node rewriting in hypergraphs
• Handle-rewriting hypergraph grammars
• Normal forms for context-free node-rewriting hypergraph grammars
• Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence
• Pullback rewriting and applications

This page was built for publication: Context-free hypergraph grammars with node rewriting