A generalization of Cobham's theorem to automata over real numbers (Q1014642): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2140093467
@@ Property / OpenAlex ID: W2140093467 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantifier elimination for the reals with a predicate for the powers of two
+Normal rank
@@ Property / cites work @@
+An effective decision procedure for linear arithmetic over the integers and reals
+Normal rank
@@ Property / cites work @@
+Counting the solutions of Presburger equations without enumerating them.
+Normal rank
@@ Property / cites work @@
+Q4219027
@@ Property / cites work: Q4219027 / rank @@
+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 @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+On the base-dependence of sets of numbers recognizable by finite automata
+Normal rank
@@ Property / cites work @@
+Tools and Algorithms for the Construction and Analysis of Systems
+Normal rank
@@ Property / cites work @@
+Efficient minimization of deterministic weak \(\omega\)-automata
+Normal rank
@@ Property / cites work @@
+Presburgerness of predicates regular in two number systems
+Normal rank
@@ Property / cites work @@
+The field of reals with a predicate for the powers of two
+Normal rank
@@ Property / cites work @@
+The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
+Normal rank
@@ Property / cites work @@
+Q4281563
@@ Property / cites work: Q4281563 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1014642