Node rewriting in graphs and hypergraphs: A categorical framework

DOI10.1016/S0304-3975(00)00200-0MaRDI QIDQ5958766zbMATH OpenOpenAlexFDO

Authors M. Bauderon, H. Jacquet

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00200-0

zbMATH Keywords

graphshypergraphsnode rewritingpullback

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Set-theoretic graph rewriting
• Publication:4502809
• Pullback rewriting and applications
• scientific article; zbMATH DE number 1231500
• scientific article; zbMATH DE number 177452

Cites work

• A category-theoretical approach to vertex replacement: the generation of infinite graphs
• A comparison of boundary graph grammars and context-free hypergraph grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Graph expressions and graph rewritings
• Graph grammars with neighbourhood-controlled embedding
• Handle-rewriting hypergraph grammars
• HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• scientific article; zbMATH DE number 3827232 (Why is no real title available?)
• scientific article; zbMATH DE number 46995 (Why is no real title available?)
• scientific article; zbMATH DE number 49833 (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 1231478 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (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
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
• Node rewriting in graphs and hypergraphs: A categorical framework
• On hyperedge replacement and BNLC graph grammars
• On the structure of node-label-controlled graph languages
• The category of typed graph grammars and its adjunctions with categories of derivations

Cited in

(17)

• On ``On graph rewritings
• Hypermap rewriting: A combinatorial approach
• The PBPO graph transformation approach
• Node replacements in embedding normal form.
• A kernel language for programmed rewriting of (hyper)graphs
• Rewriting abstract structures: materialization explained categorically
• Refined Graph Rewriting in Span-Categories
• A Unified Categorical Approach for Attributed Graph Rewriting
• Pullback Grammars Are Context-Free
• scientific article; zbMATH DE number 4049099 (Why is no real title available?)
• scientific article; zbMATH DE number 1504831 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Set-theoretic graph rewriting
• Node rewriting in graphs and hypergraphs: A categorical framework
• A uniform approach to graph rewriting: The pullback approach
• Computational Category-Theoretic Rewriting
• Node rewriting in hypergraphs

This page was built for publication: Node rewriting in graphs and hypergraphs: A categorical framework

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