In this paper, we introduce and study a rendezvous mechanism for parallel replacements of hyperedges by (hyperedge-decorated) graphs that allows some merging of the replacing graphs if the attachment of the replaced hyperedges shares some nodes. The main result shows that the rendezvous mechanism can increase the generative power of table-controlled parallel hyperedge replacement graph grammars (which themselves are more powerful than ordinary hyperedge replacement graph grammars).
CITATION STYLE
David, G., Drewes, F., & Kreowski, H. J. (1993). Hyperedge replacement with rendezvous. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 668 LNCS, pp. 167–181). Springer Verlag. https://doi.org/10.1007/3-540-56610-4_63
Mendeley helps you to discover research relevant for your work.