Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures (Q5958302): Difference between revisions

@@ Property / cites work @@
+Q4542549
@@ Property / cites work: Q4542549 / rank @@
+Normal rank
@@ Property / cites work @@
+The dot-depth hierarchy of star-free languages is infinite
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4867181
@@ Property / cites work: Q4867181 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second-order logic over rectangular pictures and recognizability by tiling systems
+Normal rank
@@ Property / cites work @@
+Q2762794
@@ Property / cites work: Q2762794 / rank @@
+Normal rank
@@ Property / cites work @@
+Context-sensitive string languages and recognizable picture languages
+Normal rank
@@ Property / cites work @@
+Q4218153
@@ Property / cites work: Q4218153 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4951166
@@ Property / cites work: Q4951166 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic quantifier alternation hierarchy over grids and graphs
+Normal rank
@@ Property / cites work @@
+Q3769981
@@ Property / cites work: Q3769981 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218948
@@ Property / cites work: Q4218948 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal order in $S_n$ and $S*_n$
@@ Property / cites work: On the maximal order in $S_n$ and $S*_n$ / rank @@
+Normal rank
@@ Property / cites work @@
+Star-free picture expressions are strictly weaker than first-order logic
+Normal rank