{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T23:51:45Z","timestamp":1676159505045},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00028-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:42:52Z","timestamp":1027611772000},"page":"11-28","source":"Crossref","is-referenced-by-count":12,"title":["On maximal codes with bounded synchronization delay"],"prefix":"10.1016","volume":"204","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00028-0_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.1983.1056597","article-title":"Algorithms for sliding block codes","volume":"IT-29","author":"Adler","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB2","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1137\/0406046","article-title":"Surjective extensions of sliding block codes","volume":"6","author":"Ashley","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB3","article-title":"S\u00e9ries rationnelles et distributions de longueurs","author":"Bassino","year":"1996"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB4","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/18.53736","article-title":"The method of poles: a coding method for constrained channels","volume":"36","author":"B\u00e9al","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB5","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","article-title":"On completion of codes with finite deciphering delay","volume":"11","author":"Bruy\u00e8re","year":"1990","journal-title":"Eur. J. Combin."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(80)90012-2","article-title":"On some properties of very pure codes","volume":"10","author":"de Luca","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB8","article-title":"Codes, mots infinis et bi-infinis","author":"Devolder","year":"1993"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/inco.1993.1066","article-title":"Precircular codes and periodic biinfinite words","volume":"107","author":"Devolder","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","article-title":"Each regular code is included in a regular maximal code","volume":"20","author":"Ehrenfeucht","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB11","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1147\/rd.245.0638","article-title":"A general method for channel coding","volume":"24","author":"Franaszek","year":"1980","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB12","series-title":"Proc. STACS'94","first-page":"691","article-title":"On codes having no finite completions","volume":"775","author":"Lam","year":"1994"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB13","first-page":"63","article-title":"Some properties of coding and self-adjusting automata for decoding messages","volume":"11","author":"Levenshtein","year":"1964","journal-title":"Problemy Kibernet."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB14","series-title":"Symbolic Dynamics and Coding","author":"Lind","year":"1996"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB15","first-page":"87","article-title":"An example of an independent system of words which cannot be included in a finite complete system","volume":"1","author":"Markov","year":"1967","journal-title":"Mat. Zametki"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB16","series-title":"STACS'93 Proc.","first-page":"333","article-title":"Local automata and completion","volume":"vol. 665","author":"Montalbano","year":"1993"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(83)90028-2","article-title":"Completing biprefix codes","volume":"28","author":"Perrin","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(75)90015-8","article-title":"A combinatorial property of codes having finite synchronization delay","volume":"1","author":"Restivo","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","article-title":"On codes having no finite completions","volume":"17","author":"Restivo","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(98)00028-0_BIB20","first-page":"21","article-title":"On a factorization of free monoids","volume":"16","author":"Sch\u00fctzenberger","year":"1965"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB21","first-page":"2419","article-title":"Sur une question concernant certains sous-mono\u00efdes libres","volume":"261","author":"Sch\u00fctzenberger","year":"1965","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0067950","article-title":"Alg\u00e8bres de Lie libres et mono\u00efdes libres","author":"Viennot","year":"1974"},{"key":"10.1016\/S0304-3975(98)00028-0_BIB23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(94)00300-8","article-title":"Completion of recognizable bifix codes","volume":"145","author":"Zhang","year":"1995","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000280?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:44Z","timestamp":1556315924000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397598000280"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00028-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}