An algebraic formalism for graphs
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.
Unable to display preview. Download preview PDF.
- [BC85]BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, (Report 8525, University Bordeaux I, Dept Maths Info 1985)Google Scholar
- [Co85]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)Google Scholar
- [Eh79]EHRIG H., Introduction to the algebraic theory of graphs, Lect. Notes in Comp. Sci. 73 Springer 1979 1–69Google Scholar
- [EK79]EHRIG H., KREOWSKI H-J., Push-out properties: An analysis of gluing constructions for graphs, Math. Nachr. 91 (1979) 135–149Google Scholar
- [EK81]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–334Google Scholar
- [HK83]HABEL A., KREOWSKI H-J., On context free graphs languages generated by edge replacement, Lect. Notes in Comp. Sci. 153 Springer 1983, 143–158Google Scholar
- [Ra84]RAOULT J.C., On graphs rewritings, Theor. Comp. Sci. 32 (1984) 114–128Google Scholar