Quasi-Sturmian colorings on regular trees

Quasi-Sturmian colorings on regular trees

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Ergodic theory and dynamical systems 2020-12, Vol.40 (12), p.3403-3419
Hauptverfasser: KIM, DONG HAN, LEE, SEUL BEE, LIM, SEONHEE, SIM, DEOKWON
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Graphs
Mathematics
Original Article
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0143-3857
1469-4417
DOI:10.1017/etds.2019.53