The subword complexity of polynomial subsequences of the Thue-Morse sequence

DOI10.5802/crmath.321OpenAlexW4281287713MaRDI QIDQ2143625

Zhao Shen

Publication date: 31 May 2022

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/crmath.321

zbMATH Keywords

Thue-Morse sequencesubword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Cites Work

• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Enumeration of factors in the Thue-Morse word
• The sum of digits of polynomial values in arithmetic progressions
• Normality of the Thue-Morse sequence along Piatetski-Shapiro sequences. II
• On the subword complexity of Thue-Morse polynomial extractions
• CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
• Automatic Sequences
• Somme des chiffres et transcendance
• The sum-of-digits function of polynomial sequences
• Sur les nombres qui ont des propriétés additives et multiplicatives données
• Unnamed Item

This page was built for publication: The subword complexity of polynomial subsequences of the Thue-Morse sequence