Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529): Difference between revisions

@@ Property / cites work @@
+A comparison of compatible, finite, and inductive graph properties
+Normal rank
@@ Property / cites work @@
+Algebraic automata and context-free sets
@@ Property / cites work: Algebraic automata and context-free sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / 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 @@
+Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
+Normal rank
@@ Property / cites work @@
+Graph expressions and graph rewritings
@@ Property / cites work: Graph expressions and graph rewritings / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VII: Graphs as relational structures
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
+Normal rank
@@ Property / cites work @@
+Q4002149
@@ Property / cites work: Q4002149 / rank @@
+Normal rank