A uniform approach to graph rewriting: The pullback approach-Reference-Cited by-同舟云学术

A uniform approach to graph rewriting: The pullback approach

Published:1995 Issue: Volume: Page:101-115
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Bauderon Michel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60618-1_69.pdf

Reference18 articles.

1. M. Bauderon, Infinite Hypergraphs I. Basic properties, Theor. Comput. Sci 82 (1991) 177–214

2. M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci 103 (1993) 165–190

3. M. Bauderon, A categorical approach to vertex replacement: the generation of infinite graphs, 5th International Conference on Graph Grammars and their applications to Computer Science, Williamsburg, November 1994, To appear, Lect. Notes in Comp. Sci.

4. M. Bauderon, Parallel rewriting through the pullback approach, in SEGRA-GRA'95, to appear, Elect. Notes in Theor. Comp. Sci.

5. M. Bauderon, B. Courcelle, Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83–127

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A PBPO+ Graph Rewriting Tutorial;Electronic Proceedings in Theoretical Computer Science;2023-04-01

2. Fuzzy Presheaves are Quasitoposes;Graph Transformation;2023

3. DLGR: A Rule-Based Approach to Graph Replacement for Deep Learning;2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS);2022-03

4. Foundations of a postmodern cybernetics based on Kabbalah;Kybernetes;2011-10-18

5. Context-Free Categorical Grammars;Algebraic Informatics;2009