A profinite approach to complete bifix decodings of recurrent languages

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.

Original Manuscript of article to be published by De Gruyter in Forum Mathematicum. The last section of the version in Forum Mathematicum is very different, as there it is not proved that the Schützenberger group is an invariant of eventual conjugacy (the argument in the Original Manuscript had a flaw), but only that its maximal pronilpotent quotient is invariant by eventual conjugacy

References in corpus (6)

• Acyclic, connected and tree sets
• A geometric interpretation of the Schützenberger group of a minimal subshift
• The linear nature of pseudowords
• On the group of a rational maximal bifix code
• Freeness of Schützenberger groups of primitive substitutions
• Pronilpotent quotients associated with primitive substitutions