Comparison of two graph-rewrite systems

P.M. van den Broek

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Scopus)
    74 Downloads (Pure)


    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.
    Original languageUndefined
    Article number10.1016/0304-3975(88)90108-9
    Pages (from-to)67-81
    Number of pages15
    JournalTheoretical computer science
    Issue number1
    Publication statusPublished - Oct 1988


    • EWI-10076
    • IR-64084

    Cite this