论文标题
一种完成复发语言的Bifix解码的方法
A profinite approach to complete bifix decodings of recurrent languages
论文作者
论文摘要
我们研究了（均匀）复发语言的完整Bifix解码的研究，并借助于自由的pofinite monoid。我们表明，通过$ f $收费的合理完整的Bifix代码对统一的经常性语言$ f $的完整Bifix解码是统一的。对于经常性语言，获得了类似的结果。
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.
