• Korean Journal of Mathematics
• /
• v.16 no.3
• /
• pp.301-307
• /
• 2008

Let $R_n$ be the the first return time to its initial n-word. Then the Ornstein-Weiss first return time theorem implies that log$R_n$ divided by n converges to entropy. We consider the convergence of log$R_n$ for Sturmian sequences which has the lowest complexity. In this case, we normalize the logarithm of the first return time by log n. We show that for any numbers $1{\leq}{\alpha},\;{\beta}{\leq}{\infty}$, there is a Sturmian sequence of which limsup is ${\alpha}$ and liminf is $1/{\beta}$.

• Journal of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1123-1137
• /
• 2015

We study colorings of regular trees using subball complexity b(n), which is the number of colored n-balls up to color-preserving isomorphisms. We show that for any k-regular tree, for k > 1, there are colorings of intermediate complexity. We then construct colorings of linear complexity b(n) = 2n + 2. We also construct colorings induced from sequences of linear subword complexity which has exponential subball complexity.