{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T22:15:22Z","timestamp":1685052922839},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1984,3]]},"DOI":"10.1016\/0020-0190(84)90020-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"155-158","source":"Crossref","is-referenced-by-count":23,"title":["Pattern Matching Machine implementation of a fast test for unique decipherability"],"prefix":"10.1016","volume":"18","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"R.","family":"Giancarlo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90020-6_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: An aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(84)90020-6_BIB2","first-page":"103","article-title":"Tests for unique decipherability","author":"Even","year":"1963","journal-title":"IEEE Trans. Information Theory IT-9"},{"key":"10.1016\/0020-0190(84)90020-6_BIB3","series-title":"Graph Algorithms","author":"Even","year":"1973"},{"key":"10.1016\/0020-0190(84)90020-6_BIB4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space economical suffix tree construction algorithm","volume":"83","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(84)90020-6_BIB5","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/TIT.1982.1056535","article-title":"A fast test for unique decipherability based on suffix trees","author":"Rodeh","year":"1982","journal-title":"IEEE Trans. Information Theory IT-28"},{"key":"10.1016\/0020-0190(84)90020-6_BIB6","series-title":"Research Division Report 50-27","article-title":"A necessary and sufficient condition for the unique decomposition of coded of messages","author":"Sardinas","year":"1950"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:57:34Z","timestamp":1555088254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084900206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["0020019084900206"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90020-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}