Font Size: a A A

Charaterization Of K-comma Code And K-comma Intercede And The Properties Of D-code

Posted on:2016-06-03Degree:MasterType:Thesis
Country:ChinaCandidate:H Y LiuFull Text:PDF
GTID:2180330470956122Subject:Operational Research and Cybernetics
Abstract/Summary:PDF Full Text Request
Cui,B.,who is from Canada, introduced the notions of k-comma code and k-comma intercode in2011. obtained the following results:every k-comma code is an infix code,every k-comma intercode is a bifix code, every k-comma intercode of index m is a k-comma intercode of index m+1and several closure properties of k-comma code and k-comma intercode.We characterizes k-comma code in terms of infix code in detail,characterizes k-comma intercode in terms of bifix code equvalently,discusses the equivalent condition that k-comma intercode of index m+is a k-comma inter-code of index m. On the homomorphism which preserves some languages,we studies the homomorphism which preserves the n-comma-free codes, n-intercodes,k-comma codes,n-k-comma codes,k-comma intercodes, n-k-comma intercodes and so on.Lin,Y.Y.,who is from Tai Wan, obtained that every d-code is pure code in1995. Another Taiwanese scholar Fan,C.M. explored the result that a nonempty language is a solid code if and only if it is a d-code and a comma-free code. We study the closures properties of d-code under union,catenation,+,complement,or non-erasing homomorphism, and the relationship among d-code,comma-free code,and other al-gebraic codes. In addition,we study the equivalent condition any two d-codes is closed under union and catenation, the homomorphism preserving d-codes.
Keywords/Search Tags:infix code, comma-free code, k-comma code, d-code, homomorphism
PDF Full Text Request
Related items