On Subword Complexity of Morphic Sequences
classification
🧮 math.CO
cs.FL
keywords
morphiccomplexitysequencessubwordarbitraryeitherfollowingmathbb
read the original 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)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.