Reduced complexities for sequences over finite alphabets

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 character $c$ (such that there is no character immediately to the left or right of $s$ equal to $c$) with $c$. Complexity functions for infinite words play important roles within combinatorics on words, and this leads us to introduce and investigate variants of the factor and abelian complexity functions using the given reduction operation. By enumerating words $v$ and $w$ of a given length $n \geq 0$ and associated with an infinite sequence over a finite alphabet such that $\text{red}(v)$ and $\text{red}(w)$ are equal or otherwise equivalent in some specified way, by analogy with the factor and abelian complexity functions, this may be seen as producing simplified versions of previously introduced complexity functions. We prove a recursion for the reduced factor complexity function $ρ_{\mathbf{t}}^{\text{red}}$ for the Thue-Morse sequence $\mathbf{t}$, giving us that $(ρ_{\mathbf{t}}^{\text{red}}(n) : n \in \mathbb{N})$ is a $2$-regular sequence, we prove an explicit evaluation for the reduced factor complexity function $ρ_{\mathbf{f}}^{\text{red}}$ for the (regular) paperfolding sequence $\mathbf{f}$, together with an evaluation for the reduced abelian complexity function $ρ_{\mathbf{f}}^{\text{ab}, \text{red}}$ for $\mathbf{f}$. We conclude with open problems concerning $ρ_{\mathbf{t}}^{\text{ab}, \text{red}}$.