Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2108.11279 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914775318921216 |
|---|---|
| author | Klouda, Karel Starosta, Štěpán |
| author_facet | Klouda, Karel Starosta, Štěpán |
| contents | Let $H$ be an HD0L-system. We show that there are only finitely many primitive words $v$ with the property that $v^k$, for all integers $k$, is an element of the factorial language of $H$. In particular, this result applies to the set of all factors of a morphic word. We provide a formalized proof in the proof assistant Isabelle/HOL as part of the Combinatorics on Words Formalized project. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2108_11279 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | The number of primitive words of unbounded exponent in the language of an HD0L-system is finite Klouda, Karel Starosta, Štěpán Combinatorics 68R15, 68Q42, 68V20 F.4.2 Let $H$ be an HD0L-system. We show that there are only finitely many primitive words $v$ with the property that $v^k$, for all integers $k$, is an element of the factorial language of $H$. In particular, this result applies to the set of all factors of a morphic word. We provide a formalized proof in the proof assistant Isabelle/HOL as part of the Combinatorics on Words Formalized project. |
| title | The number of primitive words of unbounded exponent in the language of an HD0L-system is finite |
| topic | Combinatorics 68R15, 68Q42, 68V20 F.4.2 |
| url | https://arxiv.org/abs/2108.11279 |