{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:54:15Z","timestamp":1648918455907},"reference-count":15,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90089-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"239-260","source":"Crossref","is-referenced-by-count":2,"title":["On test sets for checking morphism equivalence on languages with fair distribution of letters"],"prefix":"10.1016","volume":"33","author":[{"given":"Yael","family":"Maon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amiram","family":"Yehudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90089-6_BIB1","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/S0019-9958(82)80028-4","article-title":"Test sets for context free languages and systems of equations over a free monoid","volume":"52","author":"Albert","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(84)90089-6_BIB2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00260925","article-title":"The ultimate equivalence problem for D0L systems","volume":"10","author":"Culik","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/0304-3975(84)90089-6_BIB3","series-title":"Formal Language Theory, Perspectives and Open Problems","article-title":"Homomorphisms: Decidability, equality and test sets","author":"Culik","year":"1980"},{"key":"10.1016\/0304-3975(84)90089-6_BIB4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/S0019-9958(77)90512-5","article-title":"The decidability of the equivalence problem for D0L-systems","volume":"35","author":"Culik","year":"1977","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(84)90089-6_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0012-365X(83)90152-8","article-title":"Systems of equations over a free monoid and Ehrenfeucht Conjecture","volume":"43","author":"Culik","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(84)90089-6_BIB6","article-title":"On the Ehrenfeucht Conjecture for D0L languages","volume":"17","author":"Culik","year":"1983","journal-title":"RAIRO"},{"key":"10.1016\/0304-3975(84)90089-6_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/00207167908803155","article-title":"Homomorphism equivalence on ET0L languages","volume":"7","author":"Culik","year":"1979","journal-title":"Internat. J. Comput. Math. Sec. A"},{"key":"10.1016\/0304-3975(84)90089-6_BIB8","first-page":"163","article-title":"On the decidability of homomorphism equivalence for languages","volume":"17","author":"Culik","year":"1978","journal-title":"JCSS"},{"key":"10.1016\/0304-3975(84)90089-6_BIB9","first-page":"379","article-title":"Test sets and checking words for homomorphism equivalence","volume":"20","author":"Culik","year":"1980","journal-title":"JSCC"},{"key":"10.1016\/0304-3975(84)90089-6_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/0021-8693(83)90119-9","article-title":"On binary equality sets and a solution to the Ehrenfeucht Conjecture in the binary case","volume":"85","author":"Ehrenfeucht","year":"1983","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(84)90089-6_BIB11","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(84)90089-6_BIB12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(84)90004-5","article-title":"The Ehrenfeucht Conjecture: A compactness claim for finitely generated free monoids","volume":"29","author":"Karhum\u00e4ki","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90089-6_BIB13","unstructured":"M. Karpinski, ed., New Scottish Book of Problems, in preparation."},{"key":"10.1016\/0304-3975(84)90089-6_BIB14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0304-3975(77)90001-9","article-title":"On finite semigroups of matrices","volume":"5","author":"Mandel","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90089-6_BIB15","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900896?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900896?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:51:22Z","timestamp":1555127482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584900896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584900896"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90089-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}