Pages that link to "Item:Q2143625"
From MaRDI portal
The following pages link to The subword complexity of polynomial subsequences of the Thue-Morse sequence (Q2143625):
Displaying 10 items.
- On the structure of Thue-Morse subwords, with an application to dynamical systems (Q401317) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- Thue-Morse at multiples of an integer (Q538176) (← links)
- Subword complexity of a generalized Thue-Morse word (Q672966) (← links)
- On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439) (← links)
- On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values (Q2129347) (← links)
- On the longest common subsequence of Thue-Morse words (Q2203606) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- (Q2993620) (← links)