Graph rewriting using a single pushout: a comparison

P.M. van den Broek; Jan Kuper

Graph rewriting using a single pushout: a comparison

P.M. van den Broek, Jan Kuper

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

Recently two algebraic approaches to graph rewriting have been given which use only single pushouts. Here we compare both approaches. We show that they are almost the same, the only difference being the way dangling arcs are treated.

Original language	Undefined
Title of host publication	Computing Science in the Netherlands
Editors	J.L.G. Dietz
Place of Publication	Amsterdam
Publisher	Stichting Mathematisch Centrum
Pages	85-95
Number of pages	11
ISBN (Print)	906196413x
Publication status	Published - 1992
Event	Computing Science in the Netherlands, CSN 1992 - Jaarbeurs, Utrecht, Netherlands Duration: 4 Nov 1992 → 5 Nov 1992

Conference

Conference	Computing Science in the Netherlands, CSN 1992
Abbreviated title	CSN
Country/Territory	Netherlands
City	Utrecht
Period	4/11/92 → 5/11/92

Keywords

EWI-10079

Cite this

@inproceedings{494ec374ef86416daef21cf3f8ba0665,

title = "Graph rewriting using a single pushout: a comparison",

abstract = "Recently two algebraic approaches to graph rewriting have been given which use only single pushouts. Here we compare both approaches. We show that they are almost the same, the only difference being the way dangling arcs are treated.",

keywords = "EWI-10079",

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

year = "1992",

language = "Undefined",

isbn = "906196413x",

pages = "85--95",

editor = "J.L.G. Dietz",

booktitle = "Computing Science in the Netherlands",

publisher = "Stichting Mathematisch Centrum",

address = "Netherlands",

note = "Computing Science in the Netherlands, CSN 1992 ; Conference date: 04-11-1992 Through 05-11-1992",

}

TY - GEN

T1 - Graph rewriting using a single pushout: a comparison

AU - van den Broek, P.M.

AU - Kuper, Jan

PY - 1992

Y1 - 1992

N2 - Recently two algebraic approaches to graph rewriting have been given which use only single pushouts. Here we compare both approaches. We show that they are almost the same, the only difference being the way dangling arcs are treated.

AB - Recently two algebraic approaches to graph rewriting have been given which use only single pushouts. Here we compare both approaches. We show that they are almost the same, the only difference being the way dangling arcs are treated.

KW - EWI-10079

M3 - Conference contribution

SN - 906196413x

SP - 85

EP - 95

BT - Computing Science in the Netherlands

A2 - Dietz, J.L.G.

PB - Stichting Mathematisch Centrum

CY - Amsterdam

T2 - Computing Science in the Netherlands, CSN 1992

Y2 - 4 November 1992 through 5 November 1992

ER -