Graph rewriting using a single pushout: a comparison

P.M. van den Broek, Jan Kuper

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-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 languageUndefined
    Title of host publicationComputing Science in the Netherlands
    EditorsJ.L.G. Dietz
    Place of PublicationAmsterdam
    PublisherStichting Mathematisch Centrum
    Pages85-95
    Number of pages11
    ISBN (Print)906196413x
    Publication statusPublished - 1992
    EventComputing Science in the Netherlands 1992 - Utrecht, Netherlands
    Duration: 4 Nov 19925 Nov 1992

    Conference

    ConferenceComputing Science in the Netherlands 1992
    CountryNetherlands
    CityUtrecht
    Period4/11/925/11/92
    Other4-5 Nov 1992

    Keywords

    • EWI-10079

    Cite this

    van den Broek, P. M., & Kuper, J. (1992). Graph rewriting using a single pushout: a comparison. In J. L. G. Dietz (Ed.), Computing Science in the Netherlands (pp. 85-95). Amsterdam: Stichting Mathematisch Centrum.