The following pages link to (Q5384332):
Displaying 12 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Cyclic complexity of words (Q507796) (← links)
- Complexity for infinite words associated with quadratic non-simple Parry numbers (Q874377) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) (Q1034610) (← links)
- Feedback functions for generating cycles over a finite alphabet (Q1567672) (← links)
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439) (← links)
- Automatic complexity of Fibonacci and tribonacci words (Q2217496) (← links)
- On the abelian complexity of generalized Thue-Morse sequences (Q2420616) (← links)
- Recursively renewable words and coding of irrational rotations (Q2468459) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence (Q6546706) (← links)
