The following pages link to (Q3814828):
Displaying 13 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Versatile string kernels (Q391141) (← links)
- Concordance and consensus (Q545367) (← links)
- Sequences of linear arithmetical complexity (Q557917) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- Construction of infinite de Bruijn arrays (Q1114658) (← links)
- On the combinatorics of finite words (Q1292479) (← links)
- Complexity for finite factors of infinite sequences (Q1292491) (← links)
- Arithmetical complexity of symmetric D0L words. (Q1426472) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- On possible growths of arithmetical complexity (Q3421906) (← links)
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers (Q4645117) (← links)
