Sturmian words have been studied for a very long time (Bernoulli [1], Christoffel [3], Markoff [18], Morse and Hedlund [19], Coven and Hedlund [5], Lunnon and Pleasants [17],…). They are infinite words that have exactly n + 1 factors of length n, for each n < 0. Thus they are written in a binary alphabet. Recently a natural and promising generalization to an arbitrary alphabet was presented in [9].