Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.18280 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917999160590336 |
|---|---|
| author | Dolce, Francesco Hughes, Christian B. |
| author_facet | Dolce, Francesco Hughes, Christian B. |
| contents | A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of the well-known Rauzy induction to show that every return word in the language generated by a regular interval exchange transformation is clustering, partially answering a question of Lapointe (2021). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_18280 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Clustering of return words in languages of interval exchanges Dolce, Francesco Hughes, Christian B. Formal Languages and Automata Theory Discrete Mathematics 68R15, 37E05 A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of the well-known Rauzy induction to show that every return word in the language generated by a regular interval exchange transformation is clustering, partially answering a question of Lapointe (2021). |
| title | Clustering of return words in languages of interval exchanges |
| topic | Formal Languages and Automata Theory Discrete Mathematics 68R15, 37E05 |
| url | https://arxiv.org/abs/2504.18280 |