Continued fraction algorithm for Sturmian colorings of trees

Dong Han Kim, Seonhee Lim

Factor complexity $b_{\varphi }(n)$ for a vertex coloring $\varphi$ of a regular tree is the number of colored $n$-balls up to color-preserving automorphisms. Sturmian colorings are colorings of…