scientific article; zbMATH DE number 4049105

MaRDI QIDQ3785994zbMATH OpenFDO

Authors George Leih, Joost Engelfriet, Grzegorz Rozenberg

Publication date 1987

zbMATH Keywords

Apex graph grammarsgraph replacementsneighbourhood controlled embeddingnonterminal boundednonterminal separationregular tree grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Context-free graph languages of bounded degree are generated by apex graph grammars
• On structured graph grammars. I
• Apex graph grammars and attribute grammars
• Nonterminal separation in graph grammars
• A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions

Cited in

(12)

• Apex graph grammars and attribute grammars
• Nonterminal bounded NLC graph grammars
• Power properties of NLC graph grammars with a polynomial membership problem
• On hyperedge replacement and BNLC graph grammars
• The complexity of connectivity problems on context-free graph languages
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Linear graph grammars: Power and complexity
• A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions
• Handle-rewriting hypergraph grammars
• Complexity of boundary graph languages
• Nonterminal separation in graph grammars
• Boundary graph grammars with dynamic edge relabeling

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