Quasi-Sturmian colorings on regular trees

• Published in: Ergodic theory and dynamical systems Vol. 40; no. 12; pp. 3403 - 3419
• Main Authors: KIM, DONG HAN, LEE, SEUL BEE, LIM, SEONHEE, SIM, DEOKWON
• Format: Journal Article
• Language: English
• Published: Cambridge, UK Cambridge University Press 01.12.2020
• Subjects: Algorithms; Graphs; Mathematics; Original Article; Trees; 20F65; 68R15; 20E08; 37E25; symbolic dynamics; arithmetic and algebraic dynamics; 05C15; group actions

Quasi-Sturmian words, which are infinite words with factor complexity eventually $n+c$ share many properties with Sturmian words. In this article, we study the quasi-Sturmian colorings on regular trees. There are two different types, bounded and unbounded, of quasi-Sturmian colorings. We obtain an i...