scientific article; zbMATH DE number 4049107

MaRDI QIDQ3785996zbMATH OpenFDO

Authors Michael Main, Grzegorz Rozenberg

Publication date 1987

zbMATH Keywords

edge-replacementgraph-grammarhierarchy of language classeslabel-controlNLCnode-label controlled graph grammarsrecursive enumerabilityrewriting

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edge-label controlled graph grammars
• Graph grammars with path-controlled embedding
• scientific article; zbMATH DE number 4182839
• Linear graph grammars: Power and complexity
• Representing graph families with edge grammars

Cited in

(9)

• Graph grammars with path-controlled embedding
• Representing graph families with edge grammars
• Node replacement graph grammars with dynamic node relabeling
• scientific article; zbMATH DE number 4049103 (Why is no real title available?)
• scientific article; zbMATH DE number 1089086 (Why is no real title available?)
• Translating controlled graph grammars to ordinary graph grammars
• scientific article; zbMATH DE number 4182839 (Why is no real title available?)
• Boundary graph grammars with dynamic edge relabeling
• Edge-label controlled graph 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 Q3785996)