Author:
Bauderon Michel,Jacquet Hélène,Klempien-Hinrichs Renate
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Michel Bauderon. A category-theoretical approach to vertex replacement: The generation of infinite graphs. In Proc. 5th Intl. Workshop on Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 1073, 27–37. Springer, 1996.
2. Michel Bauderon. A uniform approach to graph rewriting: The pullback approach. In Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1017, 101–115. Springer, 1995.
3. Michel Bauderon. Parallel rewriting of graphs through the pullback approach. In Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, Electronic Notes in Theoretical Computer Science 2, 8 pages. Elsevier, 1995.
4. Michel Bauderon and Frédérique Carrére. Orthogonal decomposition of graphs. In Preproc. GRATRA 2000, TU Berlin, Report 2000-2, 197–204, 2000.
5. Michel Bauderon and Hélène Jacquet. Node rewriting in graphs and hypergraphs: a categorical framework. Theoretical Computer Science, to appear. A previous version appeared as Research Report LaBRI 1134-96, 1996.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pullback Grammars Are Context-Free;Lecture Notes in Computer Science