Detailed Information
Cited 1 time in 
Cited 1 time in 
Cited 1 time in
Metadata Downloads
Quasi-Sturmian colorings on regular trees
- Authors
- KIM, D. O. N. G. H. A. N.; LEE, S. E. U. L. B. E. E.; LIM, S. E. O. N. H. E. E.; SIM, D. E. O. K. W. O. N.
- Issue Date
- Dec-2020
- Publisher
- CAMBRIDGE UNIV PRESS
- Keywords
- symbolic dynamics; arithmetic and algebraic dynamics; group actions
- Citation
- ERGODIC THEORY AND DYNAMICAL SYSTEMS, v.40, no.12, pp 3403 - 3419
- Pages
- 17
- Indexed
- SCIE
SCOPUS
- Journal Title
- ERGODIC THEORY AND DYNAMICAL SYSTEMS
- Volume
- 40
- Number
- 12
- Start Page
- 3403
- End Page
- 3419
- ISSN
- 0143-3857
1469-4417
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Education > Department of Mathematics Education > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Kim, Dong Han
- College of Education (Department of Mathematics Education)