On sequential and parallel node-rewriting graph grammars, II

DOI10.1016/0734-189X(83)90028-2zbMath0585.68068OpenAlexW2987180893MaRDI QIDQ3709912

Dirk Janssens, R. Verraedt, Grzegorz Rozenberg

Publication date: 1983

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(83)90028-2

zbMATH Keywords

connection relationembeddings in graph grammars

Mathematics Subject Classification ID

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

Related Items (2)

Hypermap rewriting: A combinatorial approach ⋮ Generating irregular partitionable data structures

This page was built for publication: On sequential and parallel node-rewriting graph grammars, II