Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Hi-index | 0.00 |
In this paper, we examine the relationship between graph splicing languages of Freund (1995) and Hyperedge replacement graph languages. We also extend the notion of self cross-over introduced by Dassow and Mitrana (1998) to graph languages and compare them with graph splicing languages.