On sequential and parallel node-rewriting graph grammars
From MaRDI portal
Publication:3313279
DOI10.1016/0146-664X(82)90036-3zbMath0531.68030MaRDI QIDQ3313279
R. Verraedt, Dirk Janssens, Grzegorz Rozenberg
Publication date: 1982
Published in: Computer Graphics and Image Processing (Search for Journal in Brave)
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (14)
Parsing of edNLC-graph grammars for scene analysis ⋮ Complexity of boundary graph languages ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system ⋮ A hierarchy of eNCE families of graph languages ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ On the structure of linear apex NLC graph grammars ⋮ A comparison of boundary graph grammars and context-free hypergraph grammars ⋮ Hypermap rewriting: A combinatorial approach ⋮ Graph grammars according to the type of input and manipulated data: a survey ⋮ Separation results for separated apex NLC and NCE graph languages ⋮ Linear graph grammars: Power and complexity ⋮ Generating irregular partitionable data structures ⋮ Node replacement graph grammars with dynamic node relabeling
This page was built for publication: On sequential and parallel node-rewriting graph grammars
