Counting minimal semi-Sturmian words ?
A finite Sturmian  word w w is a balanced word over the binary alphabet {a,b} { a , b } , that is, for all subwords u u and v v of w w of equal length, ||u|a?|v|a|?1 | | u | a ? | v | a | ? 1 , where |u|a | u | a and |v|a | v | a denote the number of occurrences of the letter a a in u u and v v , respectively. There are several other characterizations, some leading to efficient algorithms for testing whether a finite word is Sturmian. These algorithms find important applications in areas such as pattern recognition, image processing, and computer graphics. Recently, Blanchet-Sadri and Lensmire considered finite semi-Sturmian words of minimal length and provided an algorithm for generating all of them using techniques from graph theory. In this paper, we exploit their approach in order to count the number of minimal semi-Sturmian words. We also present some other results that come from applying this graph theoretical framework to subword complexity.
semi-sturmian words graph theory subword complexity combinatorics on words eulers totient function