























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。