Comparison of two graph-rewrite systems

Share/Save/Bookmark

Broek, P.M. van den (1988) Comparison of two graph-rewrite systems. Theoretical computer science, 61 (1). pp. 67-81. ISSN 0304-3975

open access
[img]
Preview
PDF
1MB
Abstract:We compare the two graph-rewrite systems of Ehrig and Raoult. First a common domain is identified where both systems may be applied. It is shown that on this domain a Raoult rewritin exists if an Ehrig rewriting exists, but not vice versa. Out main result is that when both systems give a rewriting, these rewritings are isomorphic.
Item Type:Article
Copyright:© 1988 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64084
Official URL:http://dx.doi.org/10.1016/0304-3975(88)90108-9
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page