scientific article
From MaRDI portal
Publication:3785994
zbMath0643.68112MaRDI QIDQ3785994
George Leih, Joost Engelfriet, Grzegorz Rozenberg
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular tree grammarsneighbourhood controlled embeddingApex graph grammarsgraph replacementsnonterminal boundednonterminal separation
Related Items (10)
The complexity of connectivity problems on context-free graph languages ⋮ Handle-rewriting hypergraph grammars ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Nonterminal bounded NLC graph grammars ⋮ Complexity of boundary graph languages ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ Linear graph grammars: Power and complexity ⋮ On hyperedge replacement and BNLC graph grammars ⋮ Nonterminal separation in graph grammars
This page was built for publication:
