Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have