On sequential and parallel node-rewriting graph grammars

DOI10.1016/0146-664X(82)90036-3MaRDI QIDQ3313279zbMATH OpenFDO

Authors Dirk Janssens, R. Verraedt, Grzegorz Rozenberg

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0146-664X(82)90036-3

zbMATH Keywords

connection relationembeddinggraph grammarsparallel rewritingsequential rewriting

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, II
• Note on node-rewriting graph grammars
• scientific article; zbMATH DE number 4182839
• scientific article; zbMATH DE number 177419
• On structured graph grammars. I

Cited in

(24)

• Parsing of edNLC-graph grammars for scene analysis
• Power properties of NLC graph grammars with a polynomial membership problem
• Hypermap rewriting: A combinatorial approach
• A hierarchy of eNCE families of graph languages
• Generating irregular partitionable data structures
• Graph grammars according to the type of input and manipulated data: a survey
• Linear graph grammars: Power and complexity
• On structured graph grammars. II
• Node replacement graph grammars with dynamic node relabeling
• Complexity of boundary graph languages
• On sequential and parallel node-rewriting graph grammars, II
• scientific article; zbMATH DE number 4049017 (Why is no real title available?)
• scientific article; zbMATH DE number 177419 (Why is no real title available?)
• A formalization of sequential, parallel, and continuous rewriting
• On the structure of linear apex NLC graph grammars
• scientific article; zbMATH DE number 1504835 (Why is no real title available?)
• Synchronized composition of graph grammar productions
• scientific article; zbMATH DE number 2112160 (Why is no real title available?)
• Amalgamated graph transformations and their use for specifying AGG -- an algebraic graph grammar system
• scientific article; zbMATH DE number 4182839 (Why is no real title available?)
• Separation results for separated apex NLC and NCE graph languages
• Note on node-rewriting graph grammars
• Boundary graph grammars with dynamic edge relabeling
• A comparison of boundary graph grammars and context-free hypergraph grammars

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

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