A profinite approach to complete bifix decodings of recurrent languages
Alfredo Costa
公開日: 2022/8/24
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.