2000 character limit reached
On Subword Complexity of Morphic Sequences
Published 8 Feb 2015 in math.CO and cs.FL | (1502.02310v1)
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)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
