{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:07:24Z","timestamp":1762175244318},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0304-3975(96)00333-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"87-122","source":"Crossref","is-referenced-by-count":32,"title":["Linear generalized semi-monadic rewrite systems effectively preserve recognizability"],"prefix":"10.1016","volume":"194","author":[{"given":"P\u00e1l","family":"Gyenizse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor","family":"V\u00e1gv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1993","series-title":"String-Rewriting Systems","author":"Book","key":"10.1016\/S0304-3975(96)00333-7_BIB1"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","article-title":"Tree generating regular systems","volume":"14","author":"Brainerd","year":"1969","journal-title":"Inform and Control"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(94)90267-4","article-title":"Decidability of reachability for disjoint union of term rewriting systems","volume":"126","author":"Caron","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00333-7_BIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)90101-5","article-title":"Bottom-up tree pushdown automata: classification and connection with rewrite systems","volume":"127","author":"Coquid\u00e9","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00333-7_BIB5","first-page":"187","article-title":"Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems","volume":"88","author":"Dauchet","year":"1990","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB6","series-title":"Proc. 5th IEEE Symp. on Logic in Computer Science","first-page":"242","article-title":"The theory of ground rewrite systems is decidable","author":"Dauchet","year":"1990"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB7","first-page":"243","article-title":"Rewrite systems","volume":"Vol B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(94)90241-0","article-title":"Undecidable properties of deterministic top-down tree transducers","volume":"134","author":"F\u00fcl\u00f6p","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00333-7_BIB9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(93)90143-W","article-title":"On injectivity of deterministic top-down tree transducers","volume":"48","author":"F\u00fcl\u00f6p","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00333-7_BIB10","first-page":"175","article-title":"Congruential tree languages are the same as recognizable tree languages \u2014 A proof for a theorem of D. Kozen","volume":"39","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","article-title":"Reductions in tree replacement systems","volume":"37","author":"Gallier","year":"1985","journal-title":"Theoret. Comput. Sci."},{"year":"1984","series-title":"Tree Automata","author":"G\u00e9cseg","key":"10.1016\/S0304-3975(96)00333-7_BIB12"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB13","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby, Tree Languages, in: G. Rozenberg and A. Salomaa eds., Handbook of Formal Language Theory (Springer, Berlin), to be published.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB14","series-title":"Proc. STACS'91","first-page":"148","article-title":"Decision problems for term rewriting systems and recognizable tree languages","volume":"Vol. 480","author":"Gilleron","year":"1991"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","article-title":"Regular tree languages and rewrite systems","volume":"24","author":"Gilleron","year":"1995","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(96)00333-7_BIB16","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent Reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J.ACM"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB17","series-title":"Proc. 9th Annual ACM Symp. on Theory of Computing","first-page":"164","article-title":"Complexity of finitely presented algebras","author":"Kozen","year":"1977"},{"year":"1993","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/S0304-3975(96)00333-7_BIB18"},{"year":"1995","series-title":"On recognizability preserving string-rewriting systems","author":"Otto","key":"10.1016\/S0304-3975(96)00333-7_BIB19"},{"key":"10.1016\/S0304-3975(96)00333-7_BIB20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","article-title":"Deterministic tree pushdown automata and monadic tree rewriting systems","volume":"37","author":"Salomaa","year":"1988","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T14:19:00Z","timestamp":1580825940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596003337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0304397596003337"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00333-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}