Coding of an irrational rotation, a different view

Shigeki Akiyama

Fac. of Sci., Niigata University, Japan

It is well known that Sturmian sequences has a succesive blocking sturucture, such as $01 \rightarrow 0, 0 \rightarrow 1$. We prove that coding of any general partition of $[0,1)$ has a similar inverse limit structure driven by substitutions on bounded number of letters. Then we prove when this structure becomes stationary,i.e., the primitive substitutive word.