String attractors and bi-infinite words
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909143558782976 |
|---|---|
| author | Béaur, Pierre Gheeraert, France de Menibus, Benjamin Hellouin |
| author_facet | Béaur, Pierre Gheeraert, France de Menibus, Benjamin Hellouin |
| contents | String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which intersects an occurrence of every factor. While one-sided infinite words admitting a finite string attractor are eventually periodic, the situation is different for two-sided infinite words. In this paper, we characterise the bi-infinite words admitting a finite string attractor as the characteristic Sturmian words and their morphic images. For words that do not admit finite string attractors, we study the structure and properties of their infinite string attractors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_13449 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | String attractors and bi-infinite words Béaur, Pierre Gheeraert, France de Menibus, Benjamin Hellouin Combinatorics Discrete Mathematics 68R15 String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which intersects an occurrence of every factor. While one-sided infinite words admitting a finite string attractor are eventually periodic, the situation is different for two-sided infinite words. In this paper, we characterise the bi-infinite words admitting a finite string attractor as the characteristic Sturmian words and their morphic images. For words that do not admit finite string attractors, we study the structure and properties of their infinite string attractors. |
| title | String attractors and bi-infinite words |
| topic | Combinatorics Discrete Mathematics 68R15 |
| url | https://arxiv.org/abs/2403.13449 |