{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:23:56Z","timestamp":1648740236878},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":4184,"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":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00439-4","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"167-183","source":"Crossref","is-referenced-by-count":3,"title":["On maximal codes with a finite interpreting delay"],"prefix":"10.1016","volume":"273","author":[{"given":"Yannick","family":"Guesnet","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00439-4_BIB1","unstructured":"F. Bassino, S\u00e9ries rationnelles et distributions de longueurs, Ph.D. Thesis, Universit\u00e9 de Marne-La-Vall\u00e9e, 1996."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(00)00439-4_BIB3","unstructured":"V. Bruy\u00e8re, Codes, Dissertation pr\u00e9sent\u00e9e pour l'obtention de grade l\u00e9gal de docteur en sciences, Universit\u00e9 de Mons Hainaut, 1991."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(91)90260-9","article-title":"Maximal codes with bounded deciphering delay","volume":"84","author":"Bruy\u00e8re","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB5","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(00)00439-4_BIB6","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(00)00439-4_BIB7","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":"1998","journal-title":"Eur. J. Combinat."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB8","first-page":"383","article-title":"Some results on finite maximal codes","volume":"19","author":"de Felice","year":"1985","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB9","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(00)00439-4_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":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita:2000106","article-title":"On codes with finite interpreting delay","volume":"34","author":"Guesnet","year":"2000","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(00)00439-4_BIB12","doi-asserted-by":"crossref","unstructured":"N.H. Lam, On Codes having no Finite Completion, Lectures Notes in Computer Science, vol. 775, Springer, Berlin, 1994, pp. 691\u2013698.","DOI":"10.1007\/3-540-57785-8_182"},{"key":"10.1016\/S0304-3975(00)00439-4_BIB13","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(00)00439-4_BIB14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0021-9800(66)80015-7","article-title":"On a question concerning certain free submonoids","volume":"1","author":"Sch\u00fctzenberger","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(00)00439-4_BIB15","doi-asserted-by":"crossref","unstructured":"L. Zhang, Z. Shen, Completion of recognizable bifix codes, Theoret. Comput. Sci. 145 (1995) 345\u2013355, Note.","DOI":"10.1016\/0304-3975(94)00300-8"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:02:29Z","timestamp":1578448949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500004394"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00439-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}