On the binomial equivalence classes of finite words

Marie Lejeune, Michel Rigo, Matthieu Rosenfeld

Two finite words $u$ and $v$ are $k$-binomially equivalent if, for each word $x$ of length at most $k$, $x$ appears the same number of times as a subsequence (i.e., as a scattered…