Abstract
Quasi-Sturmian words, which are infinite words with factor complexity eventually 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 induction algorithm similar to Sturmian colorings. We distinguish them by the recurrence function.
Original language | English |
---|---|
Pages (from-to) | 3403-3419 |
Number of pages | 17 |
Journal | Ergodic Theory and Dynamical Systems |
Volume | 40 |
Issue number | 12 |
DOIs | |
State | Published - 1 Dec 2020 |
Keywords
- 05C15
- 20E08 (Primary)
- 20F65
- 37E25
- 68R15 (Secondary)
- arithmetic and algebraic dynamics
- group actions 2010 Mathematics Subject Classification
- symbolic dynamics