The subword complexity of polynomial subsequences of the Thue–Morse sequence
Let $\mathbf{t}=(t(n))_{n\geqslant 0}$ be the Thue–Morse sequence in $0,1$. J.-P. Allouche and J. Shallit asked in 2003 whether the subword complexity of the subsequence $(t(n^2))_{n\geqslant 0}$ attains the maximal value. This problem was solved positively by Y. Moshe in 2007. Indeed Y. Moshe had s...
| 主要作者: | |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Académie des sciences
2022-05-01
|
| 丛编: | Comptes Rendus. Mathématique |
| 在线阅读: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.321/ |