3 citations · 6 across the 4 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2017★ 2 cited
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,…
cs.FL2017★ 3 cited
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…
cs.FL2017
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…