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

DOI10.1007/3-540-61228-9_77MaRDI QIDQ4645266zbMATH OpenOpenAlexFDO

Authors M. 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

categorical frameworkgraph grammarinfinite graphrecursive equationterminal object

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 177419
• Nonterminal bounded NLC graph grammars
• Results of NLC grammars with one-letter terminal alphabets
• scientific article; zbMATH DE number 219258
• Structural properties of context-free sets of graphs generated by vertex replacement

Cites work

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 3827232 (Why is no real title available?)
• scientific article; zbMATH DE number 177419 (Why is no real title available?)
• scientific article; zbMATH DE number 3633737 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Hyperedge replacement: grammars and languages
• Infinite hypergraphs. I: Basic properties
• Infinite hypergraphs. II: Systems of recursive equations
• Kronecker Products and Local Joins of Graphs

Cited in

(3)

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

This page was built for publication: A category-theoretical approach to vertex replacement: the generation of infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645266)