{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T14:33:21Z","timestamp":1681742001912},"reference-count":16,"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)00440-0","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"185-196","source":"Crossref","is-referenced-by-count":5,"title":["Locally complete sets and finite decomposable codes"],"prefix":"10.1016","volume":"273","author":[{"given":"Jean","family":"N\u00e9raud","sequence":"first","affiliation":[]},{"given":"Carla","family":"Selmi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00440-0_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(00)00440-0_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0021-8693(79)90113-3","article-title":"Sur le th\u00e9or\u00e8me du d\u00e9faut","volume":"60","author":"Berstel","year":"1979","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(00)00440-0_BIB3","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(00)00440-0_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0304-3975(98)00028-0","article-title":"On maximal codes with a bounded synchronization delay","volume":"204","author":"Bruy\u00e8re","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB5","unstructured":"V. Bruy\u00e8re, M. Latteux, Variable-length maximal codes, The Proc. ICALP\u201996."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB6","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":"Eur. J. Combin."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB7","unstructured":"M.G. Castelli, D. Guaiana, S. Mantaci, Indecomposable prefix codes and prime trees, in: Symeon Bozapalidis-Aristotele (Ed.), Proc. of the Third International conference, Developments in Language Theory, University of Thessaloniki, 1997."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB8","unstructured":"J. Devolder, Codes, mots infinis et bi-infinis, Th\u00e8se de Doctorat de l'Universit\u00e9 de Lille, 1993."},{"issue":"4","key":"10.1016\/S0304-3975(00)00440-0_BIB9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1051\/ita\/1985190403831","article-title":"Some results on finite maximal codes","volume":"19","author":"De Felice","year":"1985","journal-title":"RAIRO, Theoret. Inform."},{"issue":"1","key":"10.1016\/S0304-3975(00)00440-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 one","volume":"20","author":"Ehrenfeucht","year":"1985","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0304-3975(99)00160-7","article-title":"On codes with a finite deciphering delay: constructing uncompletables words","volume":"255","author":"N\u00e9raud","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB12","unstructured":"M. Nivat, \u00c9l\u00e9ments de la th\u00e9orie des codes, in: E. Caianiello, Automata Theory, Academic Press, 1966, pp. 278\u2013294."},{"issue":"2","key":"10.1016\/S0304-3975(00)00440-0_BIB13","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. Appl."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB14","unstructured":"J.C. Spehner, Quelques probl\u00e8mes d'extension, de conjugaison et de pr\u00e9sentation sous-mono\u0131\u0308des du mono\u0131\u0308de libre, Th\u00e8se de Doctorat d\u2019\u00c9tat, Universit\u00e9 Paris 7, France, 1976."},{"key":"10.1016\/S0304-3975(00)00440-0_BIB15","doi-asserted-by":"crossref","unstructured":"R. Capocelli, C. Hoffman, Algorithms for factorizing and testing subsemigroups, in: A. Apostolico and Z. Golid (Eds.), Combinatorial Algorithms for Words, Springer, Berlin, 1985.","DOI":"10.1007\/978-3-642-82456-2_5"},{"key":"10.1016\/S0304-3975(00)00440-0_BIB16","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1051\/ita\/1990240504591","article-title":"Elementariness of a finite set of words is co-NP-complete","volume":"24","author":"N\u00e9raud","year":"1990","journal-title":"RAIRO, Theoret. Inform. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004400?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004400?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:57:24Z","timestamp":1556866644000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500004400"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00440-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}