Recognizability equals definability for partial k-paths (Q4572008): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63165-8_233
+Normal rank
@@ Property / OpenAlex ID @@
+W1804454173
@@ Property / OpenAlex ID: W1804454173 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+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 @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VIII: Orientations
+Normal rank
@@ Property / cites work @@
+Tree acceptors and some of their applications
@@ Property / cites work: Tree acceptors and some of their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizability equals definability for partial k-paths
+Normal rank
@@ Property / cites work @@
+Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+The structure of the models of decidable monadic theories of graphs
+Normal rank