Colorings of regular trees with linear subword complexity: first examples and properties
이슬비 · Seoul National University Open Repository (Seoul National University) · 2013
We study colorings of regular trees using subword complexity b(n), which is the number of equivalence classes of colored n-balls.We focus on colorings of linear subword complexity, especially colorings with b(n) = 2n + 2. We construct some colorings induced by circle rotations and prove fundamental properties of such colorings.