{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:35Z","timestamp":1725516215380},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_13","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"187-201","source":"Crossref","is-referenced-by-count":7,"title":["Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Yoshiharu","family":"Kojima","sequence":"first","affiliation":[]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-56868-9_25","volume-title":"Proc.\u00a0of 5th international conference on term rewriting and applications (RTA 1993)","author":"A.-C. Caron","year":"1993","unstructured":"Caron, A.-C., Coquide, J.-L., Dauchet, M.: Encompassment Properties and Automata with Constraints. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690, pp. 328\u2013342. Springer, Heidelberg (1993)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Comon, H.: Sequentiality, second-order monadic logic and tree automata. In: 10th annual IEEE symposium on logic in computer science (LICS 1995), pp. 508\u2013517 (1995)","DOI":"10.1109\/LICS.1995.523285"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-73449-9_10","volume-title":"Term Rewriting and Applications","author":"I. Durand","year":"2007","unstructured":"Durand, I., S\u00e9nizergues, G.: Bottom-Up Rewriting Is Inverse Recognizability Preserving. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 107\u2013121. Springer, Heidelberg (2007)"},{"key":"13_CR4","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\u2013176 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-73449-9_15","volume-title":"Term Rewriting and Applications","author":"G. Godoy","year":"2007","unstructured":"Godoy, G., Huntingford, E.: Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 184\u2013199. Springer, Heidelberg (2007)"},{"key":"13_CR6","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":"5","key":"13_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0020-0190(03)00310-7","volume":"87","author":"F. Jacquemard","year":"2003","unstructured":"Jacquemard, F.: Reachability and confluence are undecidable for flat term rewriting systems. Information processing letters\u00a087(5), 265\u2013270 (2003)","journal-title":"Information processing letters"},{"issue":"1","key":"13_CR8","first-page":"1","volume":"1998","author":"S. Lucas","year":"1998","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming\u00a01998(1), 1\u201361 (1998)","journal-title":"Journal of Functional and Logic Programming"},{"key":"13_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/11856290_8","volume-title":"Artificial Intelligence and Symbolic Computation","author":"I. Mitsuhashi","year":"2006","unstructured":"Mitsuhashi, I., Oyamaguchi, M., Jacquemard, F.: The Confluence Problem for Flat TRSs. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol.\u00a04120, pp. 68\u201381. Springer, Heidelberg (2006)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 246\u2013260. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:18Z","timestamp":1605762498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}