Recursively renewable words and coding of irrational rotations (Q2468459)

A one-sided infinite sequence over a finite alphabet is called \(k\)-renewable if there is a set of no more than \(k\) words, not all of them symbols, with the property that \(z\) is an infinite word over that set. A sequence which non-trivially permits such a decomposition infinitely often is called recursively \(k\)-renewable. Thus, for example, a Sturmian word is recursively \(2\)-renewable. Here this notion is related to sequences generated by coding irrational rotations, generalizing the combinatorial properties of Sturmian sequences. The special combinatorial properties of sequences associated to rotations with quadratic parameters are studied.