On iterating linear transformations over recognizable sets of integers (Q1884908): Difference between revisions

@@ Property / describes a project that uses @@
+LASH
@@ Property / describes a project that uses: LASH / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MONA
@@ Property / describes a project that uses: MONA / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3259278
@@ Property / cites work: Q3259278 / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
+Normal rank
@@ Property / cites work @@
+Diophantine equations, Presburger arithmetic and finite automata
+Normal rank
@@ Property / cites work @@
+Logic and \(p\)-recognizable sets of integers
@@ Property / cites work: Logic and \(p\)-recognizable sets of integers / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+On the base-dependence of sets of numbers recognizable by finite automata
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+The computational complexity of logical theories
@@ Property / cites work: The computational complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+Q5562645
@@ Property / cites work: Q5562645 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999066
@@ Property / cites work: Q3999066 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4722056
@@ Property / cites work: Q4722056 / rank @@
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
+Normal rank
@@ Property / cites work @@
+A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+Presburgerness of predicates regular in two number systems
+Normal rank
@@ Property / cites work @@
+Q4200153
@@ Property / cites work: Q4200153 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
+Normal rank
@@ Property / cites work @@
+Q4518891
@@ Property / cites work: Q4518891 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(03)00314-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2119296125
@@ Property / OpenAlex ID: W2119296125 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1884908