用profilite方法研究递归语言的完全双前缀解码
组合数学
2025-09-04 v2 动力系统
群论
摘要
我们借助自由profilite幺半群研究（一致）递归语言的完全双前缀解码。我们证明，由 F-赋值的理性完全双前缀码对一致递归语言 F 所作的完全双前缀解码仍是一致递归的。对递归语言也得到了类似结果。
引用
@article{arxiv.2208.11768,
title = {A profinite approach to complete bifix decodings of recurrent languages},
author = {Alfredo Costa},
journal= {arXiv preprint arXiv:2208.11768},
year = {2025}
}
备注
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\"utzenberger 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