2000 character limit reached
On Subword Complexity of Morphic Sequences (1502.02310v1)
Published 8 Feb 2015 in math.CO and cs.FL
Abstract: We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $\Theta(n{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.