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…