A uniform approach to graph rewriting: The pullback approach (Q6122215): Difference between revisions

@@ Property / cites work @@
+Infinite hypergraphs. I: Basic properties
@@ Property / cites work: Infinite hypergraphs. I: Basic properties / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite hypergraphs. II: Systems of recursive equations
+Normal rank
@@ Property / cites work @@
+Graph expressions and graph rewritings
@@ Property / cites work: Graph expressions and graph rewritings / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic definition of context-free rewriting and its application to NLC graph grammars
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of boundary graph grammars and context-free hypergraph grammars
+Normal rank
@@ Property / cites work @@
+Q4037292
@@ Property / cites work: Q4037292 / rank @@
+Normal rank
@@ Property / cites work @@
+Context-free graph languages of bounded degree are generated by apex graph grammars
+Normal rank
@@ Property / cites work @@
+Q4194478
@@ Property / cites work: Q4194478 / rank @@
+Normal rank
@@ Property / cites work @@
+Kronecker Products and Local Joins of Graphs
@@ Property / cites work: Kronecker Products and Local Joins of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of node-label-controlled graph languages
+Normal rank
@@ Property / cites work @@
+Q3673132
@@ Property / cites work: Q3673132 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph grammars with neighbourhood-controlled embedding
+Normal rank
@@ Property / cites work @@
+Q5639839
@@ Property / cites work: Q5639839 / rank @@
+Normal rank
@@ Property / cites work @@
+On hyperedge replacement and BNLC graph grammars
@@ Property / cites work: On hyperedge replacement and BNLC graph grammars / rank @@
+Normal rank