{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:50Z","timestamp":1725488870361},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439165"},{"type":"electronic","value":"9783540456100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45610-4_8","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T06:47:11Z","timestamp":1186901231000},"page":"98-113","source":"Crossref","is-referenced-by-count":7,"title":["Layered Transducing Term Rewriting System and Its Recognizability Preserving Property"],"prefix":"10.1007","author":[{"given":"Hiroyuki","family":"Seki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshinori","family":"Takai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youhei","family":"Fujinaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Kaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F. and Nipkow, T.: Term Rewriting and All That, Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W.S. Brained","year":"1969","unstructured":"Brained, W.S.: \u201cTree generating regular systems,\u201d Inform. and control, 14, pp. 217\u2013231, 1969.","journal-title":"Inform. and control"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)90101-5","volume":"127","author":"J.L. Coquid\u00e9","year":"1994","unstructured":"Coquid\u00e9, J.L., Dauchet, M., Gilleron, R. and V\u00e1gv\u00f6lgyi, S.: \u201cBottom-up tree pushdown automata: classification and connection with rewrite systems,\u201d Theoretical Computer Science, 127, pp. 69\u201398, 1994.","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Durand, I. and Middeldorp, A.: \u201cDecidable call by need computations in term rewriting (extended abstract),\u201d Proc. of CADE-14, North Queensland, Australia, LNAI 1249, pp. 4\u201318, 1997.","DOI":"10.1007\/3-540-63104-6_2"},{"key":"8_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proc. of RTA98","author":"T. Genet","year":"1998","unstructured":"Genet, T.: \u201cDecidable approximations of sets of descendants and sets of normal forms,\u201d Proc. of RTA98, Tsukuba, Japan, LNCS 1379, pp. 151\u2013165, 1998."},{"key":"8_CR6","unstructured":"G\u00e9cseq, F. and Steinby, M.: Tree Automata, Acad\u00e9miai Kiad\u00f3, 1984."},{"key":"8_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BFb0020795","volume-title":"Proc. of STACS\u201991","author":"R. Gilleron","year":"1991","unstructured":"Gilleron, R.: \u201cDecision problems for term rewriting systems and recognizable tree languages,\u201d Proc. of STACS\u201991, Hamburg, Germany, LNCS 480, pp. 148\u2013159, 1991."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"Gilleron, R. and Tison, S.: \u201cRegular tree languages and rewrite systems,\u201d Fundamenta Informaticae, 24, pp. 157\u2013175, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","volume":"194","author":"P. Gyenizse","year":"1998","unstructured":"Gyenizse, P. and V\u00e1gv\u00f6lgyi, S.: \u201cLinear generalized semi-monadic rewrite systems effectively preserve recognizability,\u201d Theoretical Computer Science, 194, pp. 87\u2013122, 1998.","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Proc. of RTA96","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.:\u201cDecidable approximations of term rewriting systems,\u201d Proc. of RTA96, New Brunswick, NJ, LNCS 1103, pp. 362\u2013376, 1996."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Middeldorp, A.: \u201cApproximating dependency graph using tree automata techniques,\u201d Proc. of Int\u2019l Joint Conf. on Automated Reasoning, LNAI 2083, pp. 593\u2013610, 2001.","DOI":"10.1007\/3-540-45744-5_49"},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-48685-2_22","volume-title":"Proc. of RTA99","author":"T. Nagaya","year":"1999","unstructured":"Nagaya, T. and Toyama, Y.: \u201cDecidability for left-linear growing term rewriting systems,\u201d Proc. of RTA99, Trento, Italy, LNCS 1631, pp. 256\u2013270, 1999."},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48242-3_10","volume-title":"Proc. of LPAR\u201999","author":"P. R\u00e9ty","year":"1999","unstructured":"R\u00e9ty, P.: \u201cRegular sets of descendants for constructor-based rewrite systems,\u201d Proc. of LPAR\u201999, Tbilisi, Georgia, LNCS 1705, pp. 148\u2013160, 1999."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"Salomaa, K.: \u201cDeterministic tree pushdown automata and monadic tree rewriting systems,\u201d J. Comput. system Sci., 37, pp. 367\u2013394, 1988.","journal-title":"J. Comput. system Sci."},{"key":"8_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Proc. of RTA2000","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y. and Seki, H.: \u201cRight-linear finite path overlapping term rewriting systems effectively preserve recognizability,\u201d Proc. of RTA2000, Norwich, U.K., LNCS 1833, pp. 246\u2013260, 2000."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45610-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T20:25:49Z","timestamp":1587846349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45610-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439165","9783540456100"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45610-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}