The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61228-9_89
+Normal rank
@@ Property / OpenAlex ID @@
+W1563250037
@@ Property / OpenAlex ID: W1563250037 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785989
@@ Property / cites work: Q3785989 / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary graph grammars with dynamic edge relabeling
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of node-label-controlled graph languages
+Normal rank
@@ Property / cites work @@
+Restrictions, extensions, and variations of NLC grammars
+Normal rank
@@ Property / cites work @@
+The bounded degree problem for NLC grammars is decidable
+Normal rank
@@ Property / cites work @@
+Q3714485
@@ Property / cites work: Q3714485 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785990
@@ Property / cites work: Q3785990 / rank @@
+Normal rank
@@ Property / cites work @@
+Emptiness problems of eNCE graph languages
@@ Property / cites work: Emptiness problems of eNCE graph languages / rank @@
+Normal rank