On the subword complexity of Thue-Morse polynomial extractions
From MaRDI portal
Publication:2465648
DOI10.1016/j.tcs.2007.10.015zbMath1135.68046OpenAlexW2050368732MaRDI QIDQ2465648
Publication date: 7 January 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.015
Related Items (14)
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ How to prove that a sequence is not automatic ⋮ On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values ⋮ The subword complexity of polynomial subsequences of the Thue-Morse sequence ⋮ Pseudorandom sequences derived from automatic sequences ⋮ Free subalgebras of graded algebras ⋮ Möbius orthogonality of sequences with maximal entropy ⋮ Normality of the Thue-Morse sequence along Piatetski-Shapiro sequences. II ⋮ An arithmetical property of the real numbers generated by Thue-Morse sequence along squares ⋮ Normality along squares ⋮ On \(t\)-extensions of the Hankel determinants of certain automatic sequences ⋮ The level of distribution of the Thue–Morse sequence ⋮ Generalized Thue-Morse sequences of squares ⋮ The adic realization of the Morse transformation and the extension of its action to the solenoid
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subword complexity of a generalized Thue-Morse word
- Substitution dynamical systems - spectral analysis
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Subword complexities of various classes of deterministic developmental languages without interactions
- Pascal's triangle, complexity and automata
- Transcendence of formal power series with rational coefficients
- Complexity for finite factors of infinite sequences
- Complexity of sequences and dynamical systems
- Polynomial subsequences of certain automatic sequences
- On the complexity of infinite sequences
- Enumeration of factors in the Thue-Morse word
- \(p\)-adic valuations and \(k\)-regular sequences
- Linear independence of automatic formal power series
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Squares and overlaps in the Thue-Morse sequence and some variants
- Suites algébriques, automates et substitutions
- Automatic Sequences
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Somme des chiffres et transcendance
- Uniform tag sequences
- Finite automata and morphisms in assisted musical composition*
This page was built for publication: On the subword complexity of Thue-Morse polynomial extractions
