Complexité et facteurs spéciaux

Among the factors of an infinite sequence on a finite alphabet, some elements have a particular importance: special and bispecial factors. We show how they can be used to compute the complexity of sequences, i.e. the number of factors with a given length, and to prove that certain functions are obtainable as sequence complexity whereas other functions are not.