Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2208.11768 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911134920998912 |
|---|---|
| author | Costa, Alfredo |
| author_facet | Costa, Alfredo |
| contents | We approach the study of complete bifix decodings of (uniformly) recurrent languages with the help of the free profinite monoid. We show that the complete bifix decoding of a uniformly recurrent language $F$ by an $F$-charged rational complete bifix code is uniformly recurrent. An analogous result is obtained for recurrent languages. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_11768 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A profinite approach to complete bifix decodings of recurrent languages Costa, Alfredo Combinatorics Dynamical Systems Group Theory 20M05, 68Q70, 94B35, 20E18, 37B10 We approach the study of complete bifix decodings of (uniformly) recurrent languages with the help of the free profinite monoid. We show that the complete bifix decoding of a uniformly recurrent language $F$ by an $F$-charged rational complete bifix code is uniformly recurrent. An analogous result is obtained for recurrent languages. |
| title | A profinite approach to complete bifix decodings of recurrent languages |
| topic | Combinatorics Dynamical Systems Group Theory 20M05, 68Q70, 94B35, 20E18, 37B10 |
| url | https://arxiv.org/abs/2208.11768 |