{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:58:57Z","timestamp":1767905937279,"version":"3.49.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,11,1]],"date-time":"1980-11-01T00:00:00Z","timestamp":341884800000},"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":11946,"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":[[1980,11]]},"DOI":"10.1016\/0304-3975(80)90064-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"339-342","source":"Crossref","is-referenced-by-count":14,"title":["On a bound for the D0L sequence equivalence problem"],"prefix":"10.1016","volume":"12","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90064-X_BIB1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/S0019-9958(77)90512-5","article-title":"The decidability of the equvalence problem for D0L systems","volume":"35","author":"Culik","year":"1977","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(80)90064-X_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(78)90047-6","article-title":"Elementary homomorphism and a solution of the DOL sequence equivalence problem","volume":"7","author":"Ehrenfeucht","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90064-X_BIB3","article-title":"D0L equivalence: the problem of iterated morphisms","volume":"4","author":"Salomaa","year":"1978","journal-title":"Bull. EATCS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758090064X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758090064X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:25:09Z","timestamp":1555125909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758090064X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,11]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,11]]}},"alternative-id":["030439758090064X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90064-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,11]]}}}