Sturmian word: Difference between revisions

The Sturmian word can be computed thus as an algorithm:

 

* Iterate over <math>floor(1x), floor(2x), floor(3x), \dots </math>

* If <math>kx </math> is an integer, then the program terminates. Else, if <math>floor((k-1)x) = floor(kx)</math>, then the program outputs 0, else, it outputs 10.