首页    期刊浏览 2024年08月31日 星期六
登录注册

文章基本信息

  • 标题:Free-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem
  • 作者:Cristian Grozea
  • 期刊名称:Journal of Universal Computer Science
  • 印刷版ISSN:0948-6968
  • 出版年度:2000
  • 卷号:6
  • 期号:1
  • 页码:130-135
  • 出版社:Graz University of Technology and Know-Center
  • 摘要:First, the dual set of a finite prefix-free set is defined. Using this notion we describe equivalent conditions for a finite prefix-free set to be indefinitely extendible. This lead to a simple proof for the Kraft-Chaitin Theorem. Finally, we discuss the influence of the alphabet size on the indefinite extensibility property. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有