{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T02:14:36Z","timestamp":1712715276141},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":6833,"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":[[1994,11]]},"DOI":"10.1016\/0304-3975(94)90281-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"107-117","source":"Crossref","is-referenced-by-count":6,"title":["Transducers and the decidability of independence in free monoids"],"prefix":"10.1016","volume":"134","author":[{"given":"H.","family":"J\u00fcrgensen","sequence":"first","affiliation":[]},{"given":"K.","family":"Salomaa","sequence":"additional","affiliation":[]},{"given":"S.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90281-X_BIB1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars - An extension of context-free grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)90281-X_BIB2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(94)90281-X_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","article-title":"The IO- and OI-hierarchies","volume":"20","author":"Damm","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90281-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80016-X","article-title":"An automata-theoretical characterization of the OI-hierarchy","volume":"71","author":"Damm","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90281-X_BIB5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0890-5401(91)90015-T","article-title":"Iterated stack automata and complexity classes","volume":"95","author":"Engelfriet","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90281-X_BIB6","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90281-X_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(86)90052-6","article-title":"Pushdown machines for the macro tree transducer","volume":"42","author":"Engelfriet","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90281-X_BIB8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0890-5401(87)90014-9","article-title":"Look-ahead on pushdowns","volume":"73","author":"Engelfriet","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90281-X_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02915449","article-title":"High level tree transducers and iterated pushdown tree transducers","volume":"26","author":"Engelfriet","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90281-X_BIB10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0019-9958(66)90211-7","article-title":"Preservation of languages by transducers","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90281-X_BIB11","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","article-title":"Checking automata and one-way stack languages","volume":"3","author":"Greibach","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90281-X_BIB12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0019-9958(70)80039-0","article-title":"Full AFLs and nested iterated substitution","volume":"16","author":"Greibach","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90281-X_BIB13","series-title":"Sequences II, Methods in Communication, Security, and Computer Science","first-page":"260","article-title":"Deciding code related properties by means of finite transducers","author":"Head","year":"1993"},{"key":"10.1016\/0304-3975(94)90281-X_BIB14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)90281-X_BIB15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/00207168908803768","article-title":"n-prefix-suffix languages","volume":"30","author":"Ito","year":"1989","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(94)90281-X_BIB16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0166-218X(92)90284-H","article-title":"Anti-commutative languages and n-codes","volume":"24","author":"Ito","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(94)90281-X_BIB17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(92)90341-C","article-title":"Languages whose n-element subsets are codes","volume":"96","author":"Ito","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90281-X_BIB18","first-page":"563","article-title":"Solid codes","volume":"26","author":"J\u00fcrgensen","year":"1990","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"10.1016\/0304-3975(94)90281-X_BIB19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207169108803999","article-title":"Relations on free monoids, their independent sets, and codes","volume":"40","author":"J\u00fcrgensen","year":"1991","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(94)90281-X_BIB20","unstructured":"H. J\u00fcrgensen and S.S. Yu, Dependence systems and hierarchies of families of languages, manuscript in preparation."},{"key":"10.1016\/0304-3975(94)90281-X_BIB21","series-title":"Report 327","article-title":"Syntactic monoids of codes","author":"J\u00fcrgensen","year":"1992"},{"key":"10.1016\/0304-3975(94)90281-X_BIB22","unstructured":"H. J\u00fcrgensen, K. Salomaa and S. Yu, Decidability of the intercode property, J. Inform. Process. Cybernet. EIK, to appear."},{"key":"10.1016\/0304-3975(94)90281-X_BIB23","series-title":"Fundamentals of Computation Theory, 9th Internat. Conf. FCT'93","first-page":"50","article-title":"The hierarchy of codes","volume":"Vol. 710","author":"J\u00fcrgensen","year":"1993"},{"key":"10.1016\/0304-3975(94)90281-X_BIB24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM=bNcP in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(94)90281-X_BIB25","series-title":"Free Monoids and Languages","author":"Shyr","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490281X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490281X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:37:26Z","timestamp":1621031846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759490281X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["030439759490281X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90281-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}
