首页> 外文期刊>RAIRO Theoretical Informatics and Applications >FINITE COMPLETION OF COMMA-FREE CODES PART 2
【24h】

FINITE COMPLETION OF COMMA-FREE CODES PART 2

机译:无逗号代码的有限完成第2部分

获取原文
获取原文并翻译 | 示例
           

摘要

This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.
机译:本文是本作者较早论文的续篇,其中证明了每个有限的无逗号代码都嵌入了所谓的(有限)规范无逗号代码中。在本文中,证明了每个(有限)规范无逗号代码都嵌入了一个有限的最大无逗号代码中,从而得出每个有限无逗号代码都有有限完成度的结论。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号