Finite completion of comma-free codes. Part 2
Lam, Nguyen Huong
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004), p. 117-136 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

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.

Publié le : 2004-01-01
DOI : https://doi.org/10.1051/ita:2004007
Classification:  68R15,  68S05 
@article{ITA_2004__38_2_117_0,
     author = {Lam, Nguyen Huong},
     title = {Finite completion of comma-free codes. Part 2},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {38},
     year = {2004},
     pages = {117-136},
     doi = {10.1051/ita:2004007},
     mrnumber = {2060773},
     zbl = {1058.94010},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2004__38_2_117_0}
}

Lam, Nguyen Huong. Finite completion of comma-free codes. Part 2. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) pp. 117-136. doi : 10.1051/ita:2004007. http://gdmltest.u-ga.fr/item/ITA_2004__38_2_117_0/

[1] J. Berstel and D. Perrin, Theory of Codes. Academic Press, Orlando (1985). | MR 797069 | Zbl 0587.68066

[2] N.J. Fine and H.S. Wilf, Uniqueness Theorem for Periodic Functions. Proc. Amer. Math. Soc. 16 (1965) 109-114. | MR 174934 | Zbl 0131.30203

[3] S.W. Golomb, B. Gordon and L.R. Welch, Comma-free Codes. Canad. J. Math. 10 (1958) 202-209. | MR 95091 | Zbl 0081.14601

[4] S.W. Golomb, L.R. Welch and M. Delbrück, Construction and Properties of Comma-free Codes. Biol. Medd. Dan. Vid. Selsk. 23 (1958) 3-34.

[5] M. Ito, M. Katsura, H.J. Shyr and S.S. Yu, Automata Accepting Primitive Words. Semigroup Forum 37 (1988) 45-52. | MR 929442 | Zbl 0646.20055

[6] M. Ito, H. Jürgensen, H.J. Shyr and G. Thierrin, Outfix and Infix Codes and Related Classes of Languages. J. Comput. Syst. Sci. 43 (1991) 484-508. | MR 1135474 | Zbl 0794.68087

[7] B.H. Jiggs, Recent Results in Comma-free Codes. Canad. J. Math. 15 (1963) 178-187. | MR 143672 | Zbl 0108.14304

[8] N.H. Lam, Finite Completion of Comma-Free Codes. Part 1, in Proc. of DLT 2002. Springer-Verlag, Lect. Notes Comput. Sci. 2450 357-368.

[9] R.C. Lyndon and M.-P. Shützenberger, The Equation a M =b N c P in a Free Group. Michigan Math. J. 9 (1962) 289-298. | MR 162838 | Zbl 0106.02204

[10] Al.A. Markov, An Example of an Independent System of Words Which Cannot Be Included in a Finite Complete System. Mat. Zametki 1 (1967) 87-90. | MR 210594 | Zbl 0154.00703

[11] A. Restivo, On Codes Having No Finite Completions. Discret Math. 17 (1977) 306-316. | MR 498922 | Zbl 0357.94011

[12] H.J. Shyr, Free Monoids and Languages. Lecture Notes, Hon Min Book Company, Taichung, 2001. | MR 1090325 | Zbl 0746.20050

[13] J.D. Watson and F.C.H. Crick, A Structure for Deoxyribose Nucleic Acid. Nature 171 (1953) 737.