Complexity and categoricity of injection structures induced by finite state transducers (Q2117771): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-80049-9_10
+Normal rank
@@ Property / OpenAlex ID @@
+W3183007948
@@ Property / OpenAlex ID: W3183007948 / rank @@
+Normal rank
@@ Property / cites work @@
+A general theory of translation
@@ Property / cites work: A general theory of translation / rank @@
+Normal rank
@@ Property / cites work @@
+Generic copies of countable structures
@@ Property / cites work: Generic copies of countable structures / rank @@
+Normal rank
@@ Property / cites work @@
+Injection Structures Specified by Finite State Transducers
+Normal rank
@@ Property / cites work @@
+\(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
+Normal rank
@@ Property / cites work @@
+Computability-theoretic properties of injection structures
+Normal rank
@@ Property / cites work @@
+Effective categoricity of automatic equivalence and nested equivalence structures
+Normal rank
@@ Property / cites work @@
+Automaticity of ordinals and of homogeneous graphs
+Normal rank
@@ Property / cites work @@
+On direct products of automaton decidable theories
+Normal rank
@@ Property / cites work @@
+Unary automatic graphs: an algorithmic perspective
+Normal rank
@@ Property / cites work @@
+Model-theoretic complexity of automatic structures
+Normal rank
@@ Property / cites work @@
+Automatic presentations of structures
@@ Property / cites work: Automatic presentations of structures / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic Structures: Richness and Limitations
@@ Property / cites work: Automatic Structures: Richness and Limitations / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding the isomorphism problem in classes of unary automatic structures
+Normal rank
@@ Property / cites work @@
+Analysing Complexity in Classes of Unary Automatic Structures
+Normal rank