{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:14:53Z","timestamp":1767906893790,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90214-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T07:31:32Z","timestamp":1060327892000},"page":"123-132","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Ensembles code-compatibles et une g\u00e9n\u00e9ralisation du th\u00e9or\u00e8me de Sardinas-Patterson"],"prefix":"10.1016","volume":"38","author":[{"given":"Do Long","family":"Van","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90214-2_BIB1","series-title":"Th\u00e9orie des Codes","author":"Berstel","year":"1981"},{"key":"10.1016\/0304-3975(85)90214-2_BIB2","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(85)90214-2_BIB3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/S0019-9958(67)80002-0","article-title":"The Sardinas\/Patterson and Levenstein theorems","volume":"10","author":"Riley","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(85)90214-2_BIB4","first-page":"104","article-title":"A necessary and sufficient condition for unique decomposition of coded message","volume":"8","author":"Sardinas","year":"1953","journal-title":"IER Conv. Record"},{"key":"10.1016\/0304-3975(85)90214-2_BIB5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02570808","article-title":"The intersection of free submonoids of a free monoid is free","volume":"4","author":"Tilson","year":"1972","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(85)90214-2_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1051\/ita\/1982160403711","article-title":"Codes avec des mots infinis","volume":"16","author":"Van","year":"1982","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"10.1016\/0304-3975(85)90214-2_BIB7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02572821","article-title":"Sous-mono\u00efdes et codes avec des mots infinis","volume":"26","author":"Van","year":"1983","journal-title":"Semigroup Forum"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:00:22Z","timestamp":1552608022000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585902142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":7,"alternative-id":["0304397585902142"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90214-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}