{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:39:54Z","timestamp":1776940794015,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677789","type":"print"},{"value":"9783540449805","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721975_17","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T20:43:04Z","timestamp":1167424984000},"page":"246-260","source":"Crossref","is-referenced-by-count":49,"title":["Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability"],"prefix":"10.1007","author":[{"given":"Toshinori","family":"Takai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Kaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","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.: Tree generating regular systems. Inform. and Control\u00a014, 217\u2013231 (1969)","journal-title":"Inform. and Control"},{"key":"17_CR2","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., V\u00e1gv\u00f6lgyi, S.: Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science\u00a0127, 69\u201398 (1994)","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","series-title":"Formal Models and Semantics","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 243\u2013320. Elsevier Science Publishers, Amsterdam (1990)"},{"key":"17_CR4","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-63104-6_2","volume-title":"Automated Deduction - CADE-14","author":"I. Durand","year":"1997","unstructured":"Durand, I., Middeldorp, A.: Decidable call by need computations in term rewriting (extended abstract). In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol.\u00a01249, pp. 4\u201318. Springer, Heidelberg (1997)"},{"key":"17_CR5","unstructured":"G\u00e9cseq, F., Steinby, M.: Tree Automata. Acad\u00e9miai Kiad\u00f3 (1984)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BFb0020795","volume-title":"STACS 91","author":"R. Gilleron","year":"1991","unstructured":"Gilleron, R.: Decision problems for term rewriting systems and recognizable tree languages. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480, pp. 148\u2013159. Springer, Heidelberg (1991)"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundamenta Informaticae\u00a024, 157\u2013175 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR8","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., V\u00e1gv\u00f6lgyi, S.: Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science\u00a0194, 87\u2013122 (1998)","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in Orthogonal Rewriting Systems. In: Computational Logic, Essays in Honor of Alan Robinson, ch. I and II, pp. 396\u2013443. MIT Press, Cambridge (1991)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jsco.1996.0077","volume":"23","author":"Y. Kaji","year":"1997","unstructured":"Kaji, Y., Fujiwara, T., Kasami, T.: Solving a unification problem under constrained substitutions using tree automata. J. of Symbolic Computation\u00a023(1), 79\u2013117 (1997)","journal-title":"J. of Symbolic Computation"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-48685-2_22","volume-title":"Rewriting Techniques and Applications","author":"T. Nagaya","year":"1999","unstructured":"Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 256\u2013270. Springer, Heidelberg (1999)"},{"key":"17_CR13","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.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. System Sci.\u00a037, 367\u2013394 (1988)","journal-title":"J. Comput. System Sci."},{"key":"17_CR14","unstructured":"Takai, T., Kaji, Y., Tanaka, T., Seki, H.: A procedure for solving an order-sorted unification problem - extension for left-nonlinear system. Technical Report of NAIST. NAIST-IS-TR98011 (1998), available at http:\/\/www.aist-nara.ac.jp\/"},{"key":"17_CR15","unstructured":"Takai, T., Kaji, Y., Seki, H.: A sufficient condition for the termination of the procedure for solving an order-sorted unification problem. Technical Report of NAIST. NAIST-IS-TR99010 (1999), available at http:\/\/www.aist-nara.ac.jp\/"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721975_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T15:18:59Z","timestamp":1587309539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721975_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677789","9783540449805"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/10721975_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}