The following pages link to Cyclic complexity of words (Q507796):
Displaying 26 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- On subword complexity functions (Q1057070) (← links)
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity (Q1285569) (← links)
- Modified complexity and *-Sturmian word (Q1302093) (← links)
- Partitioned factors in Christoffel and Sturmian words (Q1659982) (← links)
- On the Lie complexity of Sturmian words (Q2089692) (← links)
- Expansions of generalized Thue-Morse numbers (Q2104914) (← links)
- Lie complexity of words (Q2163386) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- Properties of a class of Toeplitz words (Q2672565) (← links)
- Topological invariants for words of linear factor complexity (Q2672961) (← links)
- A new complexity function for words based on periodicity (Q2842028) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Cyclic Permutations of Letters of Words in Languages over an Alphabet (Q3833643) (← links)
- On the character of words of sublinear complexity (Q4581961) (← links)
- The abelian complexity of infinite words and the Frobenius problem (Q4987432) (← links)
- (Q4994949) (← links)
- On a group theoretic generalization of the Morse-Hedlund theorem (Q5270140) (← links)
- (Q5384332) (← links)
- A note on the Lie complexity and beyond (Q6138836) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence (Q6546706) (← links)
