Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/112348
Title: | A profinite approach to complete bifix decodings of recurrent languages | Authors: | Costa, Alfredo | Keywords: | Code; complete bifix decoding; free profinite monoid; profinite group; symbolic dynamics; subshift; eventual conjugacy | Issue Date: | 2023 | Publisher: | Walter de Gruyter | Project: | SFRH/BSAB/150401/2019 UIDB/00324/2020 |
Serial title, monograph or event: | Forum Mathematicum | Volume: | 35 | Issue: | 4 | Abstract: | 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. As an application, we show that the Sch¨utzenberger group of an irreducible symbolic dynamical system is an invariant of eventual conjugacy. | URI: | https://hdl.handle.net/10316/112348 | ISSN: | 0933-7741 1435-5337 |
DOI: | 10.1515/forum-2022-0246 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais I&D CMUC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A profinite approach to complete bifix decodings of recurrent languages.pdf | 394.25 kB | Adobe PDF | View/Open |
Page view(s)
22
checked on Apr 24, 2024
Download(s)
5
checked on Apr 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.