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

  • Authors:

  • Ioan Tomescu

  • Affiliations:

  • Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 5.23

Visualization

Abstract

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