Abstract
To define NLC grammars for vertex replacement, we provide a categorical framework based on pullbacks in the category of graphs, whose major feature is probably that the connection relation is embedded within the rewriting rule and not distinct of it. We then indicate how it can be used to describe the generation of infinite graphs by recursive equations.
This work has been supported by the Esprit BRA “Computing with graph transformations”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Bauderon, Infinite Hypergraphs I. Basic properties, Theor. Comput. Sci. 82 (1991) 177–214
M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci. 103 (1993) 165–190
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.
M. Bauderon, Parallel rewriting of graphs through the pullback approach, SEGRAGRA '95, to appear, Elect. Notes in Theor. Comp. Sci.
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
B. Courcelle, An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141–181.
J. Engelfriet, G. Rozenberg, Graph grammars based on node rewriting: an introduction to NLC grammars, Lect. Notes in Comp. Sci. N∘ 532, 1991, 12–23.
H. Ehrig, Introduction of the algebraic theory of graph grammars, in Graph Grammars and their applications to Computer Science, Lect. Notes in Comp. Sci. N∘ 73, 1979, 1–69
M. Farzan, D.A. Waller, Kronecker products and local joins of graphs, Can. J. Math., Vol. XXIX, No 2 1977, 255–269
A. Habel, Hyperedge Replacement: Grammars and Languages, Lect. Notes in Comp. Sci. N∘ 643, 1992.
D. Janssens, G. Rozenberg, Graph grammars with node label controlled rewriting and embedding, Lect. Notes in Comp. Sci., 153 (1982), 186–205.
S. McLane, Categories for the working mathematician, Springer, Berlin, 1971
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauderon, M. (1996). A category-theoretical approach to vertex replacement: The generation of infinite graphs. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_77
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive