本文選題：內(nèi)綴碼 + 逗號(hào)自由碼　； 參考：《云南大學(xué)》2015年碩士論文

【摘要】：2011年,加拿大學(xué)者Cui,B提出了k-逗號(hào)碼和k-逗號(hào)關(guān)聯(lián),得到了每個(gè)k-逗號(hào)碼是內(nèi)綴碼,每個(gè)k-逗號(hào)關(guān)聯(lián)碼是雙綴碼,指數(shù)為m的k-逗號(hào)關(guān)聯(lián)碼是指數(shù)為m+1的k--逗號(hào)關(guān)聯(lián)碼,以及k-逗號(hào)碼和k-逗號(hào)關(guān)聯(lián)碼的一些封閉性質(zhì)等結(jié)論.本文從內(nèi)綴碼的角度對(duì)k-逗號(hào)碼進(jìn)行了詳細(xì)的刻畫,從雙綴碼的角度對(duì)k-逗號(hào)關(guān)聯(lián)碼進(jìn)行了等價(jià)刻畫,以及在何種條件下指數(shù)為m的k-逗號(hào)關(guān)聯(lián)碼與指數(shù)為m+1的k-逗號(hào)關(guān)聯(lián)碼等價(jià).在保持語言的同態(tài)映射方面,本文研究了保持n-逗號(hào)自由碼、n-關(guān)聯(lián)碼、k-逗號(hào)碼、n-k-逗號(hào)碼、k-逗號(hào)關(guān)聯(lián)碼、n-k-逗號(hào)關(guān)聯(lián)碼等語言的同態(tài)映射的充分條件. 1995年,臺(tái)灣學(xué)者Lin,Y.Y指出所有的的d-碼是純碼.另一位臺(tái)灣學(xué)者Fan,C.M得到了一個(gè)非空語言是固碼當(dāng)且僅當(dāng)它既是d-碼又是逗號(hào)自由碼.本文研究了d-碼在并、交、補(bǔ)、乘積、非擦除同態(tài)映射運(yùn)算下的封閉性,d-碼與內(nèi)綴碼、逗號(hào)自由碼等其它代數(shù)碼的關(guān)系,得到了任意兩個(gè)d-碼的在并運(yùn)算、乘積運(yùn)算下封閉,以及保持d-碼的同態(tài)映射的充分必要條件等結(jié)論.
[Abstract]:In 2011, the Canadian scholar Cuibian B proposed k-tease number and k-comma correlation, and obtained that each k-tease number is an infix code, each kcomma correlation code is a double-affix code, and the k-comma correlation code with exponent m is a k-comma correlation code with exponent M1. And some closed properties of k- tease number and k- comma correlation code, etc. In this paper, the k-comma correlation code is described in detail from the angle of infix code, and the equivalent description of k-comma correlation code is given from the point of view of double affix code. And under what conditions the kcomma correlation code with exponent m is equivalent to the kcomma correlation code with exponent M1. In this paper, we study the sufficient conditions for preserving homomorphic mapping of languages such as n-comma free code / n-correlation code / teaser number / k- tease code / comma correlation code etc. The Taiwanese scholar Linke Y. Y points out that all d- codes are pure codes. Another Taiwanese scholar, Fann C.M, obtained a nonempty language which is a fixed code if and only if it is both a d- code and a comma free code. In this paper, we study the relation between d- codes in union, intersection, complement, product, non-erasure homomorphic mapping operation and other generation codes, such as infix code, comma free code, etc. The necessary and sufficient conditions for preserving the homomorphic mapping of d- codes are also discussed.
【學(xué)位授予單位】：云南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：O157.5

【共引文獻(xiàn)】

相關(guān)期刊論文 前1條

1 劉莉;徐穎吾;;保持獨(dú)立語言和關(guān)聯(lián)碼的映射（英文）[J];紡織高校基礎(chǔ)科學(xué)學(xué)報(bào);2014年02期

，

本文編號(hào)：2009214