Abstract
We provide an algebraic structure for the set of finite graphs, whence a notion of graph expression for defining them and a complete set of equational rules for manipulating expressions.
By working at the level of expressions, one derives from this algebraic formalism a notion of graph rewriting which is as powerful and conceptually simpler than the usual categorical approach of Ehrig and alii.
Preview
Unable to display preview. Download preview PDF.
6. References
BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, (Report 8525, University Bordeaux I, Dept Maths Info 1985)
COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, To appear in Theor. Comp. Sci. (Report 8521, University Bordeaux I, Dept Maths Info 1985)
EHRIG H., Introduction to the algebraic theory of graphs, Lect. Notes in Comp. Sci. 73 Springer 1979 1–69
EHRIG H., KREOWSKI H-J., Push-out properties: An analysis of gluing constructions for graphs, Math. Nachr. 91 (1979) 135–149
EHRIG H., KREOWSKI H-J., MAGGIOLO-SCHETTINI A., ROSEN B R., WINKOWSKI J., Transformations of structures: An algebraic approach, Math. Systems Theory 14 (1981) 305–334
HABEL A., KREOWSKI H-J., On context free graphs languages generated by edge replacement, Lect. Notes in Comp. Sci. 153 Springer 1983, 143–158
RAOULT J.C., On graphs rewritings, Theor. Comp. Sci. 32 (1984) 114–128
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Bauderon, M., Courcelle, B. (1986). An algebraic formalism for graphs. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022660
Download citation
DOI: https://doi.org/10.1007/BFb0022660
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16443-2
Online ISBN: 978-3-540-39783-0
eBook Packages: Springer Book Archive