Pages that link to "Item:Q1326952"

The following pages link to Logic and \(p\)-recognizable sets of integers (Q1326952):

Displaying 40 items.

• Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
• Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order (Q2988842) (← links)
• On the Recognizability of Self-generating Sets (Q3182952) (← links)
• Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
• Effective S-adic Symbolic Dynamical Systems (Q3188236) (← links)
• Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
• On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
• A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
• Non-Regularity of ⌊α + log k n⌋ (Q3559993) (← links)
• Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (Q3618581) (← links)
• (Q3803206) (← links)
• $\mathbb \{Q\}$ muni de l’arithmétique faible de Penzin est décidable (Q4372333) (← links)
• When is an automatic set an additive basis? (Q4577830) (← links)
• First-Order Logic and Numeration Systems (Q4613547) (← links)
• A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences (Q4682404) (← links)
• Logical Theory of the Additive Monoid of Subsets of Natural Integers (Q4982989) (← links)
• (Q5020521) (← links)
• Automatic sequences of rank two (Q5044415) (← links)
• CONTRIBUTIONS TO THE THEORY OF <i>F</i>-AUTOMATIC SETS (Q5070465) (← links)
• Ultimate periodicity problem for linear numeration systems (Q5075706) (← links)
• (Q5089240) (← links)
• Recognizable sets of numbers in nonstandard bases (Q5096330) (← links)
• Spectra and satisfiability for logics with successor and a unary function (Q5109229) (← links)
• From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
• (Q5155673) (← links)
• Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
• A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
• (Q5227519) (← links)
• A More Reasonable Proof of Cobham’s Theorem (Q5859683) (← links)
• Decidability of Definability Issues in the Theory of Real Addition (Q5880942) (← links)
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)
• Regular model checking revisited (Q6045028) (← links)
• On interpretations of Presburger arithmetic in Büchi arithmetics (Q6095191) (← links)
• Decidable problems in substitution shifts (Q6126479) (← links)
• Knapsack and the power word problem in solvable Baumslag–Solitar groups (Q6159137) (← links)
• A General Approach to Proving Properties of Fibonacci Representations via Automata Theory (Q6204138) (← links)
• Power-free complementary binary morphisms (Q6565999) (← links)
• Decidability for Sturmian words (Q6597962) (← links)
• Pseudoperiodic words and a question of Shevelev (Q6599791) (← links)
• The first-order theory of binary overlap-free words is decidable (Q6622783) (← links)