Nonterminal bounded NLC graph grammars

DOI10.1016/0304-3975(88)90148-XzbMath0662.68074OpenAlexW2067295777MaRDI QIDQ1114416

George Leih, Joost Engelfriet

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90148-x

zbMATH Keywords

graph grammarsgraph languageslinear grammarsnonterminal bounded grammars

Mathematics Subject Classification ID

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

Related Items (6)

Power properties of NLC graph grammars with a polynomial membership problem ⋮ A hierarchy of eNCE families of graph languages ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ Separation results for separated apex NLC and NCE graph languages ⋮ The complexity of graph languages generated by hyperedge replacement ⋮ Linear graph grammars: Power and complexity

Cites Work

• Unnamed Item
• On the structure of node-label-controlled graph languages
• Graph grammars with neighbourhood-controlled embedding
• Linear graph grammars: Power and complexity

This page was built for publication: Nonterminal bounded NLC graph grammars