{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:02Z","timestamp":1761596702185},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"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":[[2000,7]]},"DOI":"10.1016\/s0304-3975(00)00039-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:30:26Z","timestamp":1027629026000},"page":"477-498","source":"Crossref","is-referenced-by-count":3,"title":["A property of left-linear rewrite systems preserving recognizability"],"prefix":"10.1016","volume":"242","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":[{"key":"10.1016\/S0304-3975(00)00039-6_BIB1","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(00)00039-6_BIB2","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(00)00039-6_BIB3","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(00)00039-6_BIB4","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."},{"key":"10.1016\/S0304-3975(00)00039-6_BIB5","unstructured":"F. G\u00e9cseg, M. Steinby, Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"10.1016\/S0304-3975(00)00039-6_BIB6","first-page":"1","article-title":"Tree languages","volume":"Vol. 3","author":"G\u00e9cseg","year":"1996"},{"key":"10.1016\/S0304-3975(00)00039-6_BIB7","doi-asserted-by":"crossref","unstructured":"R. Gilleron, Decision problems for term rewriting systems and recognizable tree languages, Proc. STACS\u201991, Lecture Notes in Computer Science, Vol. 480, Springer, Berlin, 1991, pp. 148\u2013159.","DOI":"10.1007\/BFb0020795"},{"key":"10.1016\/S0304-3975(00)00039-6_BIB8","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(00)00039-6_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","article-title":"Linear generalized semi-monadic rewrite systems effectively preserve recognizability","volume":"194","author":"Gyenizse","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00039-6_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(98)00055-3","article-title":"Some undecidability results concerning the property of preserving regularity","volume":"207","author":"Otto","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00039-6_BIB11","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:S0304397500000396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T08:59:47Z","timestamp":1579165187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397500000396"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00039-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}