scientific article; zbMATH DE number 522845

MaRDI QIDQ4284239zbMATH OpenFDO

Authors Bruno Courcelle

Publication date 17 April 1994

zbMATH Keywords

complete bipartite graphscontext-free languagesgraph grammarhyperedge replacementvertex replacement

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Structural properties of context-free sets of graphs generated by vertex replacement
• Context-free graph languages of bounded degree are generated by apex graph grammars
• scientific article; zbMATH DE number 522836
• scientific article; zbMATH DE number 809155
• The generative power of context-free node rewriting in hypergraphs

Cited in

(13)

• Characteristics of graph languages generated by edge replacement
• A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Structural properties of context-free sets of graphs generated by vertex replacement
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• scientific article; zbMATH DE number 5842462 (Why is no real title available?)
• Deterministic graph grammars
• scientific article; zbMATH DE number 177465 (Why is no real title available?)
• scientific article; zbMATH DE number 2016076 (Why is no real title available?)
• scientific article; zbMATH DE number 809155 (Why is no real title available?)
• Context-free hypergraph grammars with node rewriting
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
• A comparison of boundary graph grammars and context-free hypergraph grammars

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