Normal forms for context-free node-rewriting hypergraph grammars

DOI10.1017/S0960129501003528MaRDI QIDQ3146248zbMATH OpenOpenAlexFDO

Authors Renate Klempien-Hinrichs

Publication date 11 September 2002

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129501003528

zbMATH Keywords

confluent node-rewriting hypergraph grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A Greibach normal form for context-free graph grammars
• Context-free hypergraph grammars with node rewriting
• Normal form algorithms for extended context-free grammars
• A formalisation of the normal forms of context-free grammars in HOL4
• scientific article; zbMATH DE number 1762783
• scientific article; zbMATH DE number 177438
• Normal forms for phrase-structure grammars
• Normal forms for multiple context-free languages and displacement Lambek grammars
• scientific article; zbMATH DE number 1452979
• The normal form of lattice-valued context free grammars

Cited in

(7)

• The generative power of context-free node rewriting in hypergraphs
• A Local Greibach Normal Form for Hyperedge Replacement Grammars
• scientific article; zbMATH DE number 1762783 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Context-free hypergraph grammars with node rewriting
• A Greibach normal form for context-free graph grammars
• scientific article; zbMATH DE number 4189198 (Why is no real title available?)

This page was built for publication: Normal forms for context-free node-rewriting hypergraph grammars

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