Finite completion of comma-free codes. Part 2
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 2, pp. 117-136
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.
DOI :
10.1051/ita:2004007
Classification :
68R15, 68S05
Keywords: comma-free code, completion, finite maximal comma-free code
Keywords: comma-free code, completion, finite maximal comma-free code
@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},
pages = {117--136},
year = {2004},
publisher = {EDP-Sciences},
volume = {38},
number = {2},
doi = {10.1051/ita:2004007},
mrnumber = {2060773},
zbl = {1058.94010},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2004007/}
}
TY - JOUR AU - Lam, Nguyen Huong TI - Finite completion of comma-free codes. Part 2 JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2004 SP - 117 EP - 136 VL - 38 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita:2004007/ DO - 10.1051/ita:2004007 LA - en ID - ITA_2004__38_2_117_0 ER -
%0 Journal Article %A Lam, Nguyen Huong %T Finite completion of comma-free codes. Part 2 %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2004 %P 117-136 %V 38 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita:2004007/ %R 10.1051/ita:2004007 %G en %F 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) no. 2, pp. 117-136. doi: 10.1051/ita:2004007
Cité par Sources :