scientific article; zbMATH DE number 4049102

MaRDI QIDQ3785991zbMATH OpenFDO

Authors Emo Welzl

Publication date 1987

zbMATH Keywords

boundary NLC graph grammarspartition controlled graph grammarsrecognition complexity

Mathematics Subject Classification ID

Graph theory (05C99) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• scientific article; zbMATH DE number 3890755
• Power properties of NLC graph grammars with a polynomial membership problem
• scientific article; zbMATH DE number 3872712
• Graph theoretic closure properties of the family of boundary NLC graph languages

Cited in

(6)

• Logical description of context-free graph languages
• scientific article; zbMATH DE number 3890755 (Why is no real title available?)
• Complexity of boundary graph languages
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Boundary graph grammars with dynamic edge relabeling
• 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 Q3785991)