On Subword Complexity of Morphic Sequences
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)$.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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)$. |
|---|---|
| DOI: | 10.48550/arxiv.1502.02310 |