The following pages link to Uniform tag sequences (Q5666530):
Displayed 50 items.
- Automatic walks (Q1311045) (← links)
- Polynomial subsequences of certain automatic sequences (Q1311048) (← links)
- Note on the cyclic towers of Hanoi (Q1314396) (← links)
- Iteration of maps by an automaton (Q1318796) (← links)
- Complexity of generalized Rudin-Shapiro sequences (Q1320516) (← links)
- Canonical positions for the factors in paperfolding sequences (Q1329729) (← links)
- Automata calculating the complexity of automatic sequences (Q1340682) (← links)
- About the \(p\)-paperfolding words (Q1351443) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- Uniform tag systems for paperfolding sequences (Q1364478) (← links)
- Measure-theoretic complexity of ergodic systems (Q1366949) (← links)
- Transcendence of numbers with a low complexity expansion (Q1377590) (← links)
- A characterization of substitutive sequences using return words (Q1377710) (← links)
- On sequences resulting from iteration of modified quadratic and palindromic mappings (Q1389655) (← links)
- Automaticity of double sequences generated by one-dimensional linear cellular automata (Q1389657) (← links)
- Separators in infinite words generated by morphisms. (Q1390860) (← links)
- Bertrand numeration systems and recognizability (Q1391295) (← links)
- On the factors of automatic words (Q1392016) (← links)
- The asymptotic distribution of elements in automatic sequences (Q1399991) (← links)
- The ring of \(k\)-regular sequences. II. (Q1426034) (← links)
- Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
- An equivalence relation on \(\{ 0,1\}^*\) (Q1587906) (← links)
- Multiplicative functions and \(k\)-automatic sequences (Q1606180) (← links)
- On a possible classification of real-time constructed sequences (Q1824399) (← links)
- Infinite words with linear subword complexity (Q1824405) (← links)
- Hierarchie et fermeture de certaines classes de tag-systèmes (Q1837537) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Invertible substitutions on a three-letter alphabet. (Q1871489) (← links)
- Limit sets of automatic sequences. (Q1874466) (← links)
- On the complexity of algebraic numbers (Q1876890) (← links)
- Decidability questions related to abstract numeration systems (Q1877679) (← links)
- The structure of invertible substitutions on a three-letter alphabet (Q1883415) (← links)
- On a universal extraction procedure (Q1910680) (← links)
- \(\beta\)-shift, numeration systems, and automata (Q1910684) (← links)
- Linear cellular automata, finite automata and Pascal's triangle (Q1917296) (← links)
- Special factors of automatic sequences (Q1917395) (← links)
- Automatic Dirichlet series (Q1976814) (← links)
- Equivalence of right infinite words (Q2249922) (← links)
- Modularity in the semilattice of \(\omega \)-words (Q2249955) (← links)
- Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms (Q2372770) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Arithmetics properties of substitutions and infinite automata (Q2372784) (← links)
- Syndeticity and independent substitutions (Q2377960) (← links)
- Papers presented at the conference `XXIIIrd Journées Arithmétiques', Graz, Austria, July 6--12, 2003 (Q2388602) (← links)
- Automata and algebraicity (Q2388603) (← links)
- A two-valued recurrent double sequence that is not automatic (Q2437852) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts (Q2474222) (← links)
- On the complexity of algebraic numbers. II: Continued fractions (Q2495347) (← links)
- The Critical Exponent is Computable for Automatic Sequences (Q2789533) (← links)