首页 | 官方网站   微博 | 高级检索  
     


Infinite words and biprefix codes
Authors:Giuseppe PirilloDdiA Saoudi
Affiliation:

IAMI, CNR, viale Morgagni 67/A, 50134 Firenze, Italy

Abstract:Let A be an alphabet and ƒ be a right infinite word on A. If ƒ is not ultimately periodic then there exists an infinite set {vicurly logical origreater-or-equal, slanted0} of (finite) words on A such that ƒ=v0v1vi…, {vicurly logical origreater-or-equal, slanted1} is a biprefix code and vivj for positive integers ij.
Keywords:Formal languages  Combinatorial problems
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号