Algebraic graph rewriting using a single pushout

  • P. M. van den Broek
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)


We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.


  1. [1]
    H. Ehrig, H. Pfender and H.J. Schneider, Graph grammars: an algebraic approach, in: Proc. 14th Ann. Conf. on Switching and Automata Theory (1973) 167–180.Google Scholar
  2. [2]
    H. Ehrig, Introduction to the algebraic theory of graph grammars (a survey), in: V. Claus, H. Ehrig and G. Rozenberg, eds., Graph grammars and their application to Computer Science and Biology, Lecture Notes in Computer Science 73 (Springer, Berlin, 1979) 1–69.Google Scholar
  3. [3]
    J.C. Raoult, On graph rewritings, Theoret. Comput. Sci. 32 (1984) 1–24.Google Scholar
  4. [4]
    R. Kennaway, On "On graph rewritings", Theoret. Comput. Sci. 52 (1987) 37–58.Google Scholar
  5. [5]
    P.M. van den Broek, Comparison of two graph-rewrite systems, Theoret. Comput. Sci. 61 (1988) 67–81.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • P. M. van den Broek
    • 1
  1. 1.Department of Computer ScienceTwente UniversityEnschedethe Netherlands

Personalised recommendations