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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
