scientific article; zbMATH DE number 1762783

MaRDI QIDQ4538859zbMATH OpenFDO

Authors Renate Klempien-Hinrichs

Publication date 3 July 2002

zbMATH Keywords

confluent hNCE grammarscontext-free hypergraph rewritinghNCE rewriting

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The generative power of context-free node rewriting in hypergraphs
• scientific article; zbMATH DE number 1189298
• Context-free hypergraph grammars with node rewriting
• Normal forms for context-free node-rewriting hypergraph grammars
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence

Cited in

(10)

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• The generative power of context-free node rewriting in hypergraphs
• Graph-rewriting Petri nets
• Normal forms for context-free node-rewriting hypergraph grammars
• Hypergraph construction and its application to the static analysis of concurrent systems
• scientific article; zbMATH DE number 1189298 (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)
• Context-free hypergraph grammars with node rewriting
• On the Petri net realization of context-free graphs

This page was built for publication:

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