Context-free hypergraph grammars with node rewriting

DOI10.1016/S1571-0661(04)80203-2MaRDI QIDQ4923541zbMATH OpenFDO

Authors Renate Klempien-Hinrichs

Publication date 24 May 2013

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

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80203-2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 177438
• scientific article; zbMATH DE number 1762783
• Normal forms for context-free node-rewriting hypergraph grammars
• Note on node-rewriting graph grammars
• The generative power of context-free node rewriting in hypergraphs
• scientific article; zbMATH DE number 17539
• scientific article; zbMATH DE number 522845
• Handle-rewriting hypergraph grammars
• Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
• A hypergraph rewriting language and its semantics

Cites work

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 17539 (Why is no real title available?)
• scientific article; zbMATH DE number 177419 (Why is no real title available?)
• scientific article; zbMATH DE number 2016076 (Why is no real title available?)
• scientific article; zbMATH DE number 1762783 (Why is no real title available?)
• Hyperedge replacement: grammars and languages
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
• Normal forms for context-free node-rewriting hypergraph grammars
• Pullback rewriting and applications
• The generative power of context-free node rewriting in hypergraphs

Cited in

(18)

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Hypermap rewriting: A combinatorial approach
• Context-free hypergraph grammars have the same term-generating power as attribute grammars
• The generative power of context-free node rewriting in hypergraphs
• Hypergraph Lambek grammars
• scientific article; zbMATH DE number 5842462 (Why is no real title available?)
• Normal forms for context-free node-rewriting hypergraph grammars
• Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
• scientific article; zbMATH DE number 17539 (Why is no real title available?)
• scientific article; zbMATH DE number 165817 (Why is no real title available?)
• scientific article; zbMATH DE number 177419 (Why is no real title available?)
• scientific article; zbMATH DE number 177438 (Why is no real title available?)
• scientific article; zbMATH DE number 1504831 (Why is no real title available?)
• scientific article; zbMATH DE number 1762783 (Why is no real title available?)
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Note on node-rewriting graph grammars
• A comparison of boundary graph grammars and context-free hypergraph grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923541)