  Investigations of complexity of sequences lead to important applications such
as effective data compression, testing of randomness, discriminating between
information sources and many others. In this paper we establish formulas
describing the distribution functions of random variables representing the
complexity of finite sequences introduced by Lempel and Ziv in 1976. We show
that the distribution functions depend in an affine way on the probabilities of
the so called "exact" sequences.
