Pages that link to "Item:Q5569462"
From MaRDI portal
The following pages link to On the base-dependence of sets of numbers recognizable by finite automata (Q5569462):
Displaying 50 items.
- Asymptotic properties of free monoid morphisms (Q272351) (← links)
- Hyperquadratic continued fractions and automatic sequences (Q285457) (← links)
- Path sets in one-sided symbolic dynamics (Q402586) (← links)
- On automatic subsets of the Gaussian integers (Q505037) (← links)
- On certain recurrent and automatic sequences in finite fields (Q515591) (← links)
- Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
- On vanishing coefficients of algebraic power series over fields of positive characteristic (Q664335) (← links)
- Automatic maps in exotic numeration systems (Q679441) (← links)
- The signature of rational languages (Q728282) (← links)
- Subword complexity and non-automaticity of certain completely multiplicative functions (Q730313) (← links)
- Bases and ambiguity of number systems (Q798009) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- The growth ratio of synchronous rational relations is unique (Q880172) (← links)
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence (Q888175) (← links)
- Self-similar tiling systems, topological factors and stretching factors (Q1006395) (← links)
- A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
- Star-free sets of integers (Q1079381) (← links)
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable (Q1202930) (← links)
- Presburgerness of predicates regular in two number systems (Q1259594) (← 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)
- Transcendence of formal power series with rational coefficients (Q1292488) (← links)
- 2- and 3-Mahler recurrences (Q1311046) (← links)
- Uniform tag systems for paperfolding sequences (Q1364478) (← 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)
- The ring of \(k\)-regular sequences. II. (Q1426034) (← links)
- Counting the solutions of Presburger equations without enumerating them. (Q1426156) (← links)
- Invertible substitutions and local isomorphisms (Q1600203) (← links)
- Semiautomatic structures (Q1694004) (← links)
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
- Mock characters and the Kronecker symbol (Q1786705) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- Linear cellular automata, finite automata and Pascal's triangle (Q1917296) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- Robustness of Pisot-regular sequences (Q2020014) (← 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)
- Multiplicative automatic sequences (Q2069626) (← links)
- Support of an algebraic series as the range of a recursive sequence (Q2097086) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- Automata and finite order elements in the Nottingham group (Q2132478) (← links)
- Automata methods in transcendence (Q2197705) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
