Special Factors of Sequences with Linear Subword Complexity

In this paper, we prove the following result, which was conjectured by S. Ferenczi: if the complexity function of a sequence has linear growth, then its diierences are bounded by a constant.