Maximal Complexity of Finite Words

M-C. Anisiu, Z. Blazsik, Z. Kasa

The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We defin…