3 citations · 6 across the 4 of their papers we have counts for
4 papers
Constructing Words with High Distinct Square Densities
F. Blanchet-Sadri, S. Osborne
Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last,…
Dyck Words, Lattice Paths, and Abelian Borders
F. Blanchet-Sadri, Kun Chen, Kenneth Hawes
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a b…
Unavoidable Sets of Partial Words of Uniform Length
Joey Becker, F. Blanchet-Sadri, Laure Flapan +1
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a s…
Recurrent Partial Words
Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli +2
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are…