scientific article; zbMATH DE number 177418

MaRDI QIDQ4037291zbMATH OpenFDO

Authors Frank Drewes, Hans-Jörg Kreowski

Publication date 18 May 1993

zbMATH Keywords

contextfreeness lemmagrammarsgraph rewritinghyperedge replacement

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 522836
• Hyperedge replacement: grammars and languages
• scientific article; zbMATH DE number 4035178
• On hyperedge replacement and BNLC graph grammars
• scientific article; zbMATH DE number 176939

Cited in

(13)

• NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
• A partial k-arboretum of graphs with bounded treewidth
• On hyperedge replacement and BNLC graph grammars
• Generating irregular partitionable data structures
• Unification of drags and confluence of drag rewriting
• From Separation Logic to Hyperedge Replacement and Back
• scientific article; zbMATH DE number 4035178 (Why is no real title available?)
• scientific article; zbMATH DE number 4049099 (Why is no real title available?)
• scientific article; zbMATH DE number 176939 (Why is no real title available?)
• scientific article; zbMATH DE number 522836 (Why is no real title available?)
• scientific article; zbMATH DE number 2016076 (Why is no real title available?)
• Contextual hyperedge replacement
• Closure properties of context-free hyperedge replacement systems

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 Q4037291)