{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:41:56Z","timestamp":1771854116871,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00160-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"151-162","source":"Crossref","is-referenced-by-count":6,"title":["On codes with a finite deciphering delay: constructing uncompletable words"],"prefix":"10.1016","volume":"255","author":[{"given":"Jean","family":"N\u00e9raud","sequence":"first","affiliation":[]},{"given":"Carla","family":"Selmi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00160-7_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(99)00160-7_BIB2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(80)90062-6","article-title":"Minimal completable sets of words","volume":"12","author":"Bo\u00eb","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB3","unstructured":"Bruy\u00e8re, M. Latteux, Variable-length maximal codes, Proceedings of ICALP\u201996."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","article-title":"On completion of codes with deciphering delay","volume":"11","author":"Bruy\u00e8re","year":"1990","journal-title":"European J. Combin."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(88)90114-4","article-title":"On synchronizing unambiguous automata","volume":"60","author":"Carpi","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB6","unstructured":"M.G. Castelli, D. Guaiana, S. Mantaci, Indecomposable prefix codes and prime trees, in: Symeon Bozapalidis-Aristotele (Ed.), Proceedings of the 3rd International conference Developments in Language Theory, University of Thessaloniki, 1997."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(89)90076-5","article-title":"Construction of a family of finite maximal codes","volume":"63","author":"De Felice","year":"1989","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2-3","key":"10.1016\/S0304-3975(99)00160-7_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","article-title":"Sur les automates circulaires et la conjecture de C\u0306ern\u00fd","volume":"32","author":"Dubuc","year":"1998","journal-title":"Theoret. Inform. Appl."},{"issue":"1","key":"10.1016\/S0304-3975(99)00160-7_BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","article-title":"Each regular code is included in a regular maximal one","volume":"20","author":"Ehrenfeucht","year":"1985","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB10","unstructured":"M. Lothaire, Combinatorics on words, Encyclopedia of Mathematics and Appl., Addison-Wesley, Reading, MA, 1983."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB11","series-title":"Automata Theory","first-page":"278","article-title":"\u00c9l\u00e9ments de la th\u00e9orie des codes","author":"Nivat","year":"1966"},{"key":"10.1016\/S0304-3975(99)00160-7_BIB12","unstructured":"J.E. Pin, Le probl\u00e8me de la synchronisation. Contribution \u00e0 l\u2019\u00e9tude de la conjecture de C\u0306ern\u00fd, Th\u00e8se de 3eme cycle, Paris 1978."},{"key":"10.1016\/S0304-3975(99)00160-7_BIB13","unstructured":"A. Restivo, Codes and complete sets, in: D. Perrin (Ed.), Th\u00e9orie des codes, Actes de la septi\u00e8me \u00c9cole de Printemps d'informatique th\u00e9orique, Jougne 1979, \u00c9dit\u00e9 par le LITP et le centre d\u2019\u00e9dition et de documentation de l\u2019 ENSTA."},{"issue":"2","key":"10.1016\/S0304-3975(99)00160-7_BIB14","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. Inform. and Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T21:00:00Z","timestamp":1555707600000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001607"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00160-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}