Pages that link to "Item:Q1326952"

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

Displayed 50 items.

• Asymptotic properties of free monoid morphisms (Q272351) ‎ (← links)
• Deciding game invariance (Q515578) ‎ (← links)
• Regular languages of nested words: fixed points, automata, and synchronization (Q649107) ‎ (← links)
• On the regularity of the Hankel determinant sequence of the characteristic sequence of powers of 2 (Q670648) ‎ (← links)
• Deciding Boolean algebra with Presburger arithmetic (Q861705) ‎ (← links)
• Self-similar tiling systems, topological factors and stretching factors (Q1006395) ‎ (← links)
• Semi-synchronous transductions (Q1006891) ‎ (← links)
• A generalization of Cobham's theorem to automata over real numbers (Q1014642) ‎ (← links)
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) ‎ (← links)
• Morphisms and almost-periodicity (Q1270823) ‎ (← links)
• On number systems with finite degree of ambiguity (Q1271465) ‎ (← links)
• On recognizable sets of integers (Q1273179) ‎ (← links)
• Independent numeration systems and syndeticity (Q1275464) ‎ (← links)
• On Pascal triangles modulo a prime power (Q1377632) ‎ (← links)
• Automaticity of double sequences generated by one-dimensional linear cellular automata (Q1389657) ‎ (← links)
• Bertrand numeration systems and recognizability (Q1391295) ‎ (← links)
• On the factors of automatic words (Q1392016) ‎ (← links)
• The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169) ‎ (← links)
• On images of D0L and DT0L power series. (Q1401199) ‎ (← links)
• Counting the solutions of Presburger equations without enumerating them. (Q1426156) ‎ (← links)
• More on morphisms and almost-periodicity (Q1575919) ‎ (← links)
• Ostrowski numeration systems, addition, and finite automata (Q1750300) ‎ (← links)
• Multitree automata that count (Q1770418) ‎ (← links)
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) ‎ (← links)
• Decidability questions related to abstract numeration systems (Q1877679) ‎ (← links)
• On iterating linear transformations over recognizable sets of integers (Q1884908) ‎ (← links)
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) ‎ (← links)
• Additive number theory via automata theory (Q1987517) ‎ (← links)
• Permutive one-way cellular automata and the finiteness problem for automaton groups (Q2011658) ‎ (← links)
• Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) ‎ (← links)
• Substitutive systems and a finitary version of Cobham's theorem (Q2064759) ‎ (← links)
• Regular sequences and synchronized sequences in abstract numeration systems (Q2066012) ‎ (← links)
• Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) ‎ (← links)
• Synchronized sequences (Q2140455) ‎ (← links)
• Automata and tame expansions of \((\mathbb{Z}, +)\) (Q2164435) ‎ (← links)
• Automata methods in transcendence (Q2197705) ‎ (← links)
• Ostrowski-automatic sequences: theory and applications (Q2222098) ‎ (← links)
• On the expressiveness of Büchi arithmetic (Q2233416) ‎ (← links)
• On the boundary sequence of an automatic sequence (Q2237216) ‎ (← links)
• An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) ‎ (← links)
• Dynamical directions in numeration (Q2372766) ‎ (← links)
• Structural Presburger digit vector automata (Q2378536) ‎ (← links)
• Syntactical and automatic properties of sets of polynomials over finite fields (Q2469487) ‎ (← links)
• Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts (Q2474222) ‎ (← links)
• A multidimensional critical factorization theorem (Q2581347) ‎ (← links)
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) ‎ (← links)
• Automatic winning shifts (Q2672264) ‎ (← links)
• Properties of a class of Toeplitz words (Q2672565) ‎ (← links)
• On digital sequences associated with Pascal's triangle (Q2696006) ‎ (← links)
• Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) ‎ (← links)