We investigate the relation between the complexity function of a sequence, that is the number p(n) of its factors of length n, and the rank of the associated dynamical system, that is the number of Rokhlin towers required to approximate it. We prove that if the rank is one, then lim , but give examples with lim for any prescribed function G with G (n) = 0(an) for every a > 1. We give exact computations for examples of the ‘staircase’ type, which are strongly mixing systems with quadratic complexity. Conversely, for minimal sequences, if p(n) < an + b for some a ≥ 1, the rank is at most 2[a], with bounded strings of spacers, and the system is generated by a finite number of substitutions.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.