{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T17:16:57Z","timestamp":1767892617386,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0890-5401(90)90028-g","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"107-114","source":"Crossref","is-referenced-by-count":3,"title":["Parallel complexity of the regular code problem"],"prefix":"10.1016","volume":"86","author":[{"given":"Bruce E.","family":"Litow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90028-G_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0890-5401(90)90028-G_BIB2","author":"Aho","year":"1972"},{"issue":"No. 3","key":"10.1016\/0890-5401(90)90028-G_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0020-0190(84)90020-6","article-title":"Pattern matching implementation of a fast test for unique decipherability","volume":"18","author":"Apostolico","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(90)90028-G_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","article-title":"On computing the determinant in small parallel time using a small number of processors","volume":"18","author":"Berkowitz","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(90)90028-G_BIB5","author":"Berstel","year":"1985"},{"key":"10.1016\/0890-5401(90)90028-G_BIB6","first-page":"85","article-title":"Trends in the theory of codes","volume":"29","author":"Berstel","year":"1986","journal-title":"Bull. EATCS"},{"key":"10.1016\/0890-5401(90)90028-G_BIB7","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(90)90028-G_BIB8","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0890-5401(90)90028-G_BIB9","series-title":"26th IEEE FOCS","first-page":"490","article-title":"Improved processor bounds for algebraic and combinatorial problems in rnc","author":"Galil","year":"1985"},{"key":"10.1016\/0890-5401(90)90028-G_BIB10","author":"Kuich","year":"1986"},{"key":"10.1016\/0890-5401(90)90028-G_BIB11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res."},{"key":"10.1016\/0890-5401(90)90028-G_BIB12","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","volume":"IT-28","author":"Rodeh","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(90)90028-G_BIB13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90028-G_BIB14","author":"Salomaa","year":"1978"},{"key":"10.1016\/0890-5401(90)90028-G_BIB15","first-page":"104","article-title":"A necessary and sufficient condition for the unique decomposition of coded messages","volume":"Vol. 8","author":"Sardinas","year":"1953"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090028G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090028G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:58Z","timestamp":1548879958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090028G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["089054019090028G"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90028-g","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}