{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:55:51Z","timestamp":1648659351420},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00097-5","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T11:52:06Z","timestamp":1048593126000},"page":"129-138","source":"Crossref","is-referenced-by-count":3,"title":["On maximal synchronous codes"],"prefix":"10.1016","volume":"307","author":[{"given":"Yannick","family":"Guesnet","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00097-5_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(03)00097-5_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0304-3975(98)00028-0","article-title":"On maximal codes with bounded synchronization delay","volume":"204","author":"Bruy\u00e8re","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(98)00253-9","article-title":"Maximal bifix codes","volume":"218","author":"Bruy\u00e8re","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB4","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":"European J. Combin."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB5","unstructured":"J. Devolder, Codes, mots infinis et bi-infinis, Th\u00e8se de Doctorat, Universit\u00e9 Lille 1, 1993."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB6","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":"Theoret. Informatics Appl."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0304-3975(00)00439-4","article-title":"On maximal codes with finite interpreting delay","volume":"273","author":"Guesnet","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0012-365X(00)00333-2","article-title":"Extended synchronizing codewords for q-ary complete prefix codes","volume":"231","author":"Perkins","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","article-title":"On codes having no finite completion","volume":"17","author":"Restivo","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1051\/ita\/1989230201351","article-title":"Completing codes","volume":"23","author":"Restivo","year":"1989","journal-title":"Theoret. Informatics Appl."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB11","unstructured":"M.P. Sch\u00fctzenberger, Une th\u00e9orie alg\u00e9brique du codage, in: S\u00e9minaire Dubreil-Pisot 1955\u201356, Institut H. Poincar\u00e9, Expos\u00e9 no. 15, 1956."},{"key":"10.1016\/S0304-3975(03)00097-5_BIB12","series-title":"Theory of Synchronous Communications","author":"Stiffler","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000975?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000975?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T03:28:32Z","timestamp":1553657312000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503000975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503000975"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00097-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}