  This paper deals with the complexity of strings, which play an important role
in biology (nucleotid sequences), information theory and computer science. The
d-complexity of a string is defined as the number of its distinct d-substrings
given in Definition 1. The case d=1 is studied in detail.
