{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:37Z","timestamp":1720201117454},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90151-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"247-262","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Balance of many-valued transductions and equivalence problems"],"prefix":"10.1016","volume":"47","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(86)90151-9_BIB1","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(86)90151-9_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alteration","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90151-9_BIB3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(76)90066-9","article-title":"On the decidability of the sequence equivalence problem for D0L-systems","volume":"3","author":"Culik","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90151-9_BIB4","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\/0304-3975(86)90151-9_BIB5","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(86)90151-9_BIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1051\/ita\/1983170302051","article-title":"On the Ehrenfeucht Conjecture for D0L languages","volume":"17","author":"Culik","year":"1983","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(86)90151-9_BIB7","first-page":"30","article-title":"Decision problems solved with the help of the Ehrenfeucht Conjecture","volume":"27","author":"Culik","year":"1985","journal-title":"EATCS Bulletin"},{"key":"10.1016\/0304-3975(86)90151-9_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(78)90002-8","article-title":"On the decidability of homomorphism equivence for languages","volume":"17","author":"Culik","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90151-9_BIB9","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":"19","author":"Culik","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90151-9_BIB10","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/S0019-9958(79)90082-2","article-title":"Equality languages and fixed-point languages","volume":"43","author":"Engelfriet","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90151-9_BIB11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/321466.321473","article-title":"The unsolvability of the equivalence problem for \u03bb-free nondeterministic generalized machines","volume":"15","author":"Griffiths","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90151-9_BIB12","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(86)90151-9_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1051\/ita\/1985190302031","article-title":"On the equivalence of compositions of morphisms and inverse morphisms on regular languages","volume":"19","author":"Karhum\u00e4ki","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(86)90151-9_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0022-0000(86)90032-2","article-title":"A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language","volume":"32","author":"Karhum\u00e4ki","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90151-9_BIB15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(84)90055-3","article-title":"Inverse morphic equivalence on languages","volume":"19","author":"Karhum\u00e4ki","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90151-9_BIB16","first-page":"34","article-title":"The non-existence of finite test sets for set-equivalence of finite substitutions","volume":"28","author":"Lawrence","year":"1986","journal-title":"EATCS Bulletin"},{"key":"10.1016\/0304-3975(86)90151-9_BIB17","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/BF00288471","article-title":"On the equivalence of some transductions involving letter-to-letter morphisms on regular languages","volume":"23","author":"Maon","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90151-9_BIB18","article-title":"Decision problems concerning equivalence of transductions on languages","author":"Maon","year":"1985"},{"key":"10.1016\/0304-3975(86)90151-9_BIB19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(84)90089-6","article-title":"On test sets for checking morphism equivalence on languages with fair distribution of letters","volume":"33","author":"Maon","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90151-9_BIB20","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(86)90151-9_BIB21","first-page":"127","article-title":"Equality sets for homomorphisms of free monoids","volume":"4","author":"Salomaa","year":"1978","journal-title":"Acta Cybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:53:17Z","timestamp":1553158397000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":21,"alternative-id":["0304397586901519"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90151-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}