Completing comma-free codes

We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.

[1]  J. Berstel,et al.  Theory of codes , 1985 .

[2]  S. Golomb,et al.  Comma-Free Codes , 1958, Canadian Journal of Mathematics.

[3]  B. H. Jiggs,et al.  Regent Results in Comma-Free Codes , 1963, Canadian Journal of Mathematics.

[4]  Dominique Perrin.  Completing Biprefix Codes , 1984, Theor. Comput. Sci..

[5]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[6]  S. I. Rubinow.  Mathematical Problems in the Biological Sciences , 1987 .

[7]  Andrzej Ehrenfeucht,et al.  Each Regular Code Is Included in A Maximal Regular Code , 1986, RAIRO Theor. Informatics Appl..

[8]  Huei-Jan Shyr,et al.  Automata accepting primitive words , 1988 .

[9]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[10]  Véronique Bruyère,et al.  On Completion of Codes with Finite Deciphering Delay , 1990, Eur. J. Comb..

[11]  Liang Zhang,et al.  Completion of Recognizable Bifix Codes , 1995, Theor. Comput. Sci..

[12]  H. Shyr.  Free monoids and languages , 1979 .

[13]  M. Muramatsu,et al.  J. D. Watson & F. H. C. Crick: A Structure for Deoxyribose Nucleic Acid , 2002 .

[14]  Basil Gordon,et al.  Codes With Bounded Synchronization Delay , 1965, Inf. Control..

[15]  F H Crick,et al.  CODES WITHOUT COMMAS. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[16]  F. Young.  Biochemistry , 1955, The Indian Medical Gazette.

[17]  F. Crick,et al.  Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid , 1953, Nature.

[18]  Martynas Yčas,et al.  The biological code , 1969 .

[19]  R. Fraser.  The structure of deoxyribose nucleic acid. , 2004, Journal of structural biology.