Comparison of two graph-rewrite systems

P.M. van den Broek

doi:10.1016/0304-3975(88)90108-9

Comparison of two graph-rewrite systems

P.M. van den Broek

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

203 Downloads (Pure)

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.

Original language	Undefined
Article number	10.1016/0304-3975(88)90108-9
Pages (from-to)	67-81
Number of pages	15
Journal	Theoretical computer science
Volume	61
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(88)90108-9
Publication status	Published - Oct 1988

Keywords

EWI-10076
IR-64084

Access to Document

10.1016/0304-3975(88)90108-9

Cite this

@article{cf59960714c449119f9a5ac472353648,

title = "Comparison of two graph-rewrite systems",

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.",

keywords = "EWI-10076, IR-64084",

author = "\{van den Broek\}, P.M.",

year = "1988",

month = oct,

doi = "10.1016/0304-3975(88)90108-9",

language = "Undefined",

volume = "61",

pages = "67--81",

journal = "Theoretical computer science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Comparison of two graph-rewrite systems

AU - van den Broek, P.M.

PY - 1988/10

Y1 - 1988/10

N2 - 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.

AB - 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.

KW - EWI-10076

KW - IR-64084

U2 - 10.1016/0304-3975(88)90108-9

DO - 10.1016/0304-3975(88)90108-9

M3 - Article

SN - 0304-3975

VL - 61

SP - 67

EP - 81

JO - Theoretical computer science

JF - Theoretical computer science

IS - 1

M1 - 10.1016/0304-3975(88)90108-9

ER -