Edge-label controlled graph grammars

DOI10.1016/0022-0000(90)90012-AzbMath0694.68054OpenAlexW2063818895MaRDI QIDQ909484

Michael G. Main, Grzegorz Rozenberg

Publication date: 1990

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(90)90012-a

zbMATH Keywords

graph-grammar

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (3)

Handle-rewriting hypergraph grammars ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ Node replacement graph grammars with dynamic node relabeling

Cites Work

• Handle NLC grammars and r. e. languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Decision problems for node label controlled graph grammars
• Graph grammars with neighbourhood-controlled embedding
• Direction independent context-sensitive grammars
• An “Interchange Lemma” for Context-Free Languages
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-label controlled graph grammars