Upper Bound for Palindromic and Factor Complexity of Rich Words

Josef Rukavicka

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called ric…