A characterization of the words occurring as factors in a minimum number of words

AbstractWe show by an injective proof that a word w of length k⩾2 occurs as a factor in a minimum number of words of length n(n>k) if and only if all letters of w are equal