{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:14:38Z","timestamp":1648797278572},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"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":11124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,2]]},"DOI":"10.1016\/0022-0000(83)90022-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"82-91","source":"Crossref","is-referenced-by-count":5,"title":["Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages"],"prefix":"10.1016","volume":"26","author":[{"given":"J\u00fcrgen","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90022-3_BIB1","article-title":"Test Sets for Context-Free Languages and Algebraic Systems of Equations over a Free Monoid","author":"Albert","year":"1981"},{"key":"10.1016\/0022-0000(83)90022-3_BIB2","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/0209057","article-title":"Equality sets and complexity classes","volume":"9","author":"Book","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90022-3_BIB3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(79)90080-2","article-title":"Some decidability results about regular and pushdown translations","volume":"8","author":"Culik","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(83)90022-3_BIB4","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"167","article-title":"Homomorphisms: decidability, equality, and test sets","author":"Culik","year":"1980"},{"key":"10.1016\/0022-0000(83)90022-3_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/00207168008803207","article-title":"A homomorphic characterization of time and space complexity classes of languages","volume":"8A","author":"Culik","year":"1980","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0022-0000(83)90022-3_BIB6","article-title":"Systems of equations over a free monoid and Ehrenfeucht Conjecture","author":"Culik","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0022-0000(83)90022-3_BIB7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(78)90002-8","article-title":"On the decidability of homomorphism equivalence for languages","volume":"17","author":"Culik","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90022-3_BIB8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0022-0000(80)90013-6","article-title":"Test sets and checking words for homomorphism equivalence","volume":"20","author":"Culik","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90022-3_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(78)90047-6","article-title":"Elementary homomorphisms and a solution to the DOL sequence equivalence problem","volume":"7","author":"Ehrenfeucht","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90022-3_BIB10","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0022-0000(83)90022-3_BIB11","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(83)90022-3_BIB12","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1980"},{"issue":"145","key":"10.1016\/0022-0000(83)90022-3_BIB13","first-page":"148","article-title":"The problem of solvability of equations in a free semigroup","volume":"103","author":"Makanin","year":"1977","journal-title":"Mat. Sb."},{"key":"10.1016\/0022-0000(83)90022-3_BIB14","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:50:34Z","timestamp":1550307034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0022000083900223"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90022-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}