Showing cs.FLShow all
2 papers · 1 filter
cs.FL2020
On the binomial equivalence classes of finite words
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
Two finite words and are -binomially equivalent if, for each word of length at most , appears the same number of times as a subsequence (i.e., as a scattered…
cs.FL2020
Reconstructing Words from Right-Bounded-Block Words
Pamela Fleischmann, Marie Lejeune, Florin Manea +2
A reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of sca…