{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:28:58Z","timestamp":1648571338926},"reference-count":14,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1051\/ita:2004006","type":"journal-article","created":{"date-parts":[[2004,5,25]],"date-time":"2004-05-25T15:50:51Z","timestamp":1085500251000},"page":"91-115","source":"Crossref","is-referenced-by-count":1,"title":["Finite Completion of comma-free codes Part 1"],"prefix":"10.1051","volume":"38","author":[{"given":"Nguyen Huong","family":"Lam","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2004,6,15]]},"reference":[{"key":"R1","unstructured":"J. Berstel and D. Perrin,Theory of Codes. Academic Press, Orlando (1985)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1073\/pnas.43.5.416","volume":"43","author":"Crick","year":"1957","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"R3","doi-asserted-by":"crossref","first-page":"202","DOI":"10.4153\/CJM-1958-023-9","volume":"10","author":"Golomb","year":"1958","journal-title":"Canad. J. Math."},{"key":"R4","first-page":"3","volume":"23","author":"Golomb","year":"1958","journal-title":"Biol. Medd. Dan. Vid. Selsk"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"W.L. Eastman, On the Construction of Comma-free Codes.IEEE Trans. Inform. TheoryIT-11(1965) 263-267.","DOI":"10.1109\/TIT.1965.1053766"},{"key":"R6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.5556\/j.tkjm.29.1998.4284","volume":"29","author":"Fan","year":"1998","journal-title":"Tamkang J. Math."},{"key":"R7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/0022-0000(91)90026-2","volume":"43","author":"Ito","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"key":"R8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.4153\/CJM-1963-021-1","volume":"15","author":"Jiggs","year":"1963","journal-title":"Canad. J. Math."},{"key":"R9","unstructured":"N.H. Lam, Finite Completion of Comma-free Codes. Part I, inProc. DLT. Springer-Verlag,Lect. Notes Comput. Sci.2450(2002) 357-368."},{"key":"R10","first-page":"87","volume":"1","author":"Markov","year":"1967","journal-title":"Mat. Zametki"},{"key":"R11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0012-365X(77)90164-9","volume":"17","author":"Restivo","year":"1977","journal-title":"Discret Math."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"R.A. Scholtz, Maximal and Variable Word-length Comma-free Codes.IEEE Trans. Inform. TheoryIT-15(1969) 555-559.","DOI":"10.1109\/TIT.1969.1054292"},{"key":"R13","unstructured":"H.J. Shyr,Free Monoids and Languages. Lecture Notes, Hon Min Book Company, Taichung (1991)."},{"key":"R14","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1038\/171737a0","volume":"171","author":"Watson","year":"1953","journal-title":"Nature"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2004006\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:21:06Z","timestamp":1623972066000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2004006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":14,"journal-issue":{"issue":"2"},"alternative-id":["ita0405a"],"URL":"https:\/\/doi.org\/10.1051\/ita:2004006","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}