Decision problems for edge grammars (Q5096886): Difference between revisions

@@ Property / cites work @@
+An undecidable problem about rational sets and contour words of polyominoes
+Normal rank
@@ Property / cites work @@
+Representing graph families with edge grammars
@@ Property / cites work: Representing graph families with edge grammars / 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 @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Decision problems and regular chain code picture languages
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of compatible, finite, and inductive graph properties
+Normal rank
@@ Property / cites work @@
+Metatheorems for decision problems on hyperedge replacement graph languages
+Normal rank
@@ Property / cites work @@
+Q4711083
@@ Property / cites work: Q4711083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Decision problems for node label controlled graph grammars
+Normal rank
@@ Property / cites work @@
+Neighborhood-uniform NLC grammars
@@ Property / cites work: Neighborhood-uniform NLC grammars / rank @@
+Normal rank
@@ Property / cites work @@
+The bounded degree problem for NLC grammars is decidable
+Normal rank
@@ Property / cites work @@
+Efficient decision procedures for graph properties on context-free graph languages
+Normal rank
@@ Property / cites work @@
+Graph theoretic closure properties of the family of boundary NLC graph languages
+Normal rank