Model-theoretic complexity of automatic structures (Q636281): Difference between revisions

@@ Property / cites work @@
+Logical Reversibility of Computation
@@ Property / cites work: Logical Reversibility of Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5295697
@@ Property / cites work: Q5295697 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Orbits of Computably Enumerable Sets
+Normal rank
@@ Property / cites work @@
+Automaticity of ordinals and of homogeneous graphs
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003861
@@ Property / cites work: Q4003861 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4451633
@@ Property / cites work: Q4451633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249356
@@ Property / cites work: Q4249356 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Pseudo-Well-Orderings
@@ Property / cites work: Recursive Pseudo-Well-Orderings / rank @@
+Normal rank
@@ Property / cites work @@
+On direct products of automaton decidable theories
+Normal rank
@@ Property / cites work @@
+Q4938557
@@ Property / cites work: Q4938557 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic linear orders and trees
@@ Property / cites work: Automatic linear orders and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of Second-Order Theories and Automata on Infinite Trees
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5551146
@@ Property / cites work: Q5551146 / rank @@
+Normal rank
@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / rank @@
+Normal rank