A category-theoretical approach to vertex replacement: The generation of infinite graphs

DOI10.1007/3-540-61228-9_77zbMath1412.68098OpenAlexW1591997028MaRDI QIDQ4645266

Michel Bauderon

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_77

zbMATH Keywords

infinite graphgraph grammarrecursive equationterminal objectcategorical framework

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items

Pullback rewriting and applications ⋮ Node rewriting in graphs and hypergraphs: A categorical framework

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Infinite hypergraphs. II: Systems of recursive equations
• Infinite hypergraphs. I: Basic properties
• Graph expressions and graph rewritings
• Kronecker Products and Local Joins of Graphs