A representation of graphs by algebraic expressions and its use for graph rewriting systems

We define a set of operations on graphs and an algebraic notation for finite graphs. A complete axiomatization of the equivalence of graph expressions by equational rules is given. Graph rewriting systems can be defined as rewriting systems on graph expressions. This new definition is equivalent to the classical one using double push-outs.

[1]  Bruno Courcelle,et al.  On context-free sets of graphs and their monadic second-order theory , 1986, Graph-Grammars and Their Application to Computer Science.

[2]  Hartmut Schmeck,et al.  Algebraic Characterization of Reducible Flowcharts , 1983, J. Comput. Syst. Sci..

[3]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[4]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[5]  C Mauduit,et al.  Unispectral morphisms , 1986 .

[6]  Max Dauchet,et al.  Théorie des Magmoïdes (II) , 1979, RAIRO Theor. Informatics Appl..

[7]  C. C. Elgot.  Monadic Computation And Iterative Algebraic Theories , 1982 .

[8]  Annegret Habel,et al.  On context-free gragh languages generated by edge replacement , 1982, Graph-Grammars and Their Application to Computer Science.

[9]  Seymour Ginsburg,et al.  Two Families of Languages Related to ALGOL , 1962, JACM.

[10]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[11]  Zoltán Ésik,et al.  Axiomatizing Schemes and Their Behaviors , 1985, J. Comput. Syst. Sci..

[12]  Manfred Nagl.  Bibliography on graph-rewriting systems (graph grammars) , 1982, Graph-Grammars and Their Application to Computer Science.

[13]  B. Courcelle.  Fundamental properties of infinite trees , 1983 .

[14]  Grzegorz Rozenberg,et al.  Neighbourhood-Uniform NLC Grammars , 1986, WG.

[15]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[16]  Grzegorz Rozenberg,et al.  A Survey of NLC Grammars , 1983, CAAP.

[17]  Annegret Habel,et al.  Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement , 1987, STACS.

[18]  Jean-Claude Raoult,et al.  On graph rewritings , 1984, Bull. EATCS.

[19]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.