Complexity for finite factors of infinite sequences
We define several notions of language complexity for finite words, and use them to define and compute some new complexity functions for infinite sequences. In particular, they give a new characterization of Sturmian sequences and discriminate between Sturmian sequences with bounded or unbounded partial quotients. (C) 1999 Elsevier Science B.V. All rights reserved.
complexity finite factors infinite words