A Category-Theoretical approach to Vertex Replacement: The generation of Infinite Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1073, Issue , 1996, Pages 27-37

  Bauderon, Michel ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

CONNECTION RELATION; INFINITE GRAPH; RECURSIVE EQUATIONS; REWRITING RULES; THEORETICAL APPROACH; VERTEX REPLACEMENT;

GRAPH THEORY;

EID: 84947804635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_77     Document Type: Conference Paper

References (12)

1. M. Bauderon, Infinite Hypergraphs I. Basic properties, Theor. Comput. Sci. 82 (1991) 177-214
2. M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci. 103 (1993) 165-190
3. M. Bauderon, A Uniform approach to graph rewriting: the pullback approach Research Report 1058-95, LaBRI, Bordeaux I University 1995, WG '95, to appear, Lect. Notes in Comp. Sci.
4. M. Bauderon, Parallel rewriting of graphs through the pullback approach, SEGRAGRA '95, to appear, Elect. Notes in Theor. Comp. Sci.
5. M. Bauderon, Infinite graphs generated by vertex replacement, in preparation, LaBRI, Bordeaux I University, 1995 M. Bauderon, B. Courcelle, Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83-127
6. B. Courcelle, An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141-181.
7. J. Engelfriet, G. Rozenberg, Graph grammars based on node rewriting: an introduction to NLC grammars, Lect. Notes in Comp. Sci. No 532, 1991, 12-23.
8. H. Ehrig, Introduction of the algebraic theory of graph grammars, in Graph Grammars and their applications to Computer Science, Lect. Notes in Comp. Sci. No 73, 1979, 1-69
9. M. Farzan, D.A. Waller, Kronecker products and local joins of graphs, Can. J. Math., Vol. XXIX, No 2 1977, 255-269
10. A. Habel, Hyperedge Replacement: Grammars and Languages, Lect. Notes in Comp. Sci. No 643, 1992.
11. D. Janssens, G. Rozenberg, Graph grammars with node label controlled rewriting and embedding, Lect. Notes in Comp. Sci., 153 (1982), 186-205.
12. S. McLane, Categories for the working mathematician, Springer, Berlin, 1971