Article contents
Quasi-Sturmian colorings on regular trees
Published online by Cambridge University Press: 09 August 2019
Abstract
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 induction algorithm similar to Sturmian colorings. We distinguish them by the recurrence function.
MSC classification
- Type
- Original Article
- Information
- Copyright
- © Cambridge University Press, 2019
References
- 1
- Cited by