Quasi-Sturmian colorings on regular trees

Dong Han Kim, Seul Bee Lee, Seonhee Lim +1

Quasi-Sturmian words, which are infinite words with factor complexity eventually $n+c$ share many properties with Sturmian words. In this paper, we study the quasi-Sturmian colorin…