상세 보기
Quasi-Sturmian colorings on regular trees
- 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.
Citations
WEB OF SCIENCE
1Citations
SCOPUS
1초록
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.
키워드
symbolic dynamics; arithmetic and algebraic dynamics; group actions; COMPLEXITY
- 제목
- Quasi-Sturmian colorings on regular trees
- 저자
- 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.
- 발행일
- 2020-12
- 유형
- Article
- 권
- 40
- 호
- 12
- 페이지
- 3403 ~ 3419
- 언어
- ENG
- 출판사
- CAMBRIDGE UNIV PRESS
- 발행국가
- 미국
- 분량
- 17 페이지
- ISSN
- E 1469-4417
P 0143-3857