On sequential and parallel node-rewriting graph grammars, II

DOI10.1016/0734-189X(83)90028-2MaRDI QIDQ3709912zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On sequential and parallel node-rewriting graph grammars
• Note on node-rewriting graph grammars
• Parallel composition of graph grammars
• On structured graph grammars. II
• scientific article; zbMATH DE number 177419
• scientific article; zbMATH DE number 4182839
• Term graph rewriting and parallel term rewriting
• Graphs of grammars - derivations as parallel processes
• scientific article; zbMATH DE number 176940

Cited in

(8)

• On sequential and parallel node-rewriting graph grammars
• scientific article; zbMATH DE number 2112160 (Why is no real title available?)
• Hypermap rewriting: A combinatorial approach
• scientific article; zbMATH DE number 177419 (Why is no real title available?)
• scientific article; zbMATH DE number 4182839 (Why is no real title available?)
• Note on node-rewriting graph grammars
• Generating irregular partitionable data structures
• scientific article; zbMATH DE number 4049017 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709912)