Automatic structures of bounded degree revisited (Q3107359): Difference between revisions

@@ Property / author @@
-Dietrich Kuske
@@ Property / author: Dietrich Kuske / rank @@
-Normal rank
@@ Property / author @@
+Dietrich Kuske
@@ Property / author: Dietrich Kuske / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2570921773
@@ Property / OpenAlex ID: W2570921773 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Definable relations and first-order query languages over strings
+Normal rank
@@ Property / cites work @@
+Single-valuedness of tree transducers is decidable in polynomial time
+Normal rank
@@ Property / cites work @@
+Automata Presenting Structures: A Survey of the Finite String Case
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+On direct products of automaton decidable theories
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+First-order and counting theories of<i>ω</i>-automatic structures
+Normal rank