The following pages link to Uniform tag sequences (Q5666530):
Displayed 50 items.
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- The Morse sequence and iterated morphisms (Q1154288) (← links)
- Folds! (Q1168345) (← links)
- Folds! II: Symmetry disturbed (Q1168346) (← links)
- Folds! III: More morphisms (Q1168347) (← links)
- Digital sum problems and substitutions on a finite alphabet (Q1179021) (← links)
- Pattern spectra, substring enumeration, and automatic sequences (Q1190468) (← links)
- Some studies on the \((p,q)\)-type sequences (Q1190483) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Tag systems generating Thue irreductible sequences (Q1249168) (← links)
- Hankel determinants of the Thue-Morse sequence (Q1265649) (← links)
- On recognizable sets of integers (Q1273179) (← links)
- Transcendence of formal power series with rational coefficients (Q1292488) (← links)
- Toeplitz sequences, \(p\)-paperfolding, automatic sequences and polynomials (Q1307363) (← links)
- 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)
- Morphisms on infinite alphabets, countable states automata and regular sequences (Q1674337) (← links)
- On the regularity of \(\{\lfloor \log_b(\alpha n+\beta)\rfloor\}_{n\geq 0}\) (Q1685967) (← links)
- Sturmian images of non Sturmian words and standard morphisms (Q1698732) (← links)
- Normality along squares (Q1725579) (← links)
- Transcendence of \(L(1,\chi_{s})/\Pi\) and automata (Q1747221) (← 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)