Reduced complexities for sequences over finite alphabets

John M. Campbell, James Currie, Narad Rampersad

Letting $w$ denote a finite, nonempty word, let $\text{red}(w)$ denote the word obtained from $w$ by replacing every subword $s$ of $w$ of the form $cc\cdots c$ for a given charac…