The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975): Difference between revisions

@@ Property / cites work @@
+Q4218128
@@ Property / cites work: Q4218128 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Finite presentations of infinite structures: Automata and interpretations
+Normal rank
@@ Property / cites work @@
+FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+On the regular structure of prefix rewriting
@@ Property / cites work: On the regular structure of prefix rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+On better quasi-ordering countable trees
@@ Property / cites work: On better quasi-ordering countable trees / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamental properties of infinite trees
@@ Property / cites work: Fundamental properties of infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385535
@@ Property / cites work: Q4385535 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. IV: Definability properties of equational graphs
+Normal rank
@@ Property / cites work @@
+Monadic second-order definable graph transductions: a survey
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. IX: Machines and their behaviours
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. X: Linear orderings
+Normal rank
@@ Property / cites work @@
+Clique-width of countable graphs: A compactness property.
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs XVI : Canonical graph decompositions
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+The evaluation of first-order substitution is monadic second-order compatible
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Decomposition of Directed Graphs
@@ Property / cites work: Decomposition of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999150
@@ Property / cites work: Q3999150 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263467
@@ Property / cites work: Q4263467 / rank @@
+Normal rank
@@ Property / cites work @@
+Primitivity is hereditary for 2-structures
@@ Property / cites work: Primitivity is hereditary for 2-structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4492680
@@ Property / cites work: Q4492680 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of relations. Transl. from the French by P. Clote
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
+Normal rank
@@ Property / cites work @@
+Q3312199
@@ Property / cites work: Q3312199 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4297398
@@ Property / cites work: Q4297398 / rank @@
+Normal rank
@@ Property / cites work @@
+Indecomposable graphs
@@ Property / cites work: Indecomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4145882
@@ Property / cites work: Q4145882 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of ends, pushdown automata, and second-order logic
+Normal rank
@@ Property / cites work @@
+Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
+Normal rank