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.
Cite
CITATION STYLE
Bauderon, M. (1996). A Category-Theoretical approach to Vertex Replacement: The generation of Infinite Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 27–37). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_77
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
