Online Computation of Abelian Runs

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre +1

Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$.…