{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:49:20Z","timestamp":1778914160447,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540734475","type":"print"},{"value":"9783540734499","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_15","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"184-199","source":"Crossref","is-referenced-by-count":5,"title":["Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[]},{"given":"Eduard","family":"Huntingford","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"15_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":"15_CR3","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J.(ed.) Handbook of Theoretical Computer Science (Vol.\u00a0B: Formal Models and Semantics), pp. 243\u2013320, Amsterdam, North-Holland (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S012905410000003X","volume":"11","author":"H. Ganzinger","year":"2000","unstructured":"Ganzinger, H., Jacquemard, F., Veanes, M.: Rigid reachability: The non-symmetric form of rigid E-unification. Intl. Journal of Foundations of Computer Science\u00a011(1), 3\u201327 (2000)","journal-title":"Intl. Journal of Foundations of Computer Science"},{"key":"15_CR5","series-title":"Lecture Notes in Artificial Intelligence","first-page":"91","volume-title":"Intl. Joint Conf. on Automated Deduction","author":"G. Godoy","year":"2004","unstructured":"Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(ground or variable) rewrite systems by rewrite closure. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 91\u2013106. Springer, Heidelberg (2004)"},{"key":"15_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/11532231_12","volume-title":"Automated Deduction \u2013 CADE-20","author":"G. Godoy","year":"2005","unstructured":"Godoy, G., Tiwari, A.: Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules. In: Nieuwenhuis, R. (ed.) Automated Deduction \u2013 CADE-20. LNCS (LNAI), vol.\u00a03632, pp. 164\u2013176. Springer, Heidelberg (2005)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-36494-3_9","volume-title":"STACS 2003","author":"G. Godoy","year":"2003","unstructured":"Godoy, G., Tiwari, A., Verma, R.: On the confluence of linear shallow term rewrite systems. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 85\u201396. Springer, Heidelberg (2003)"},{"key":"15_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., Vgvlgyi, S.: Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science\u00a0194, 87\u2013122 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"15_CR9","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. Inf. Process. Lett.\u00a087(5), 265\u2013270 (2003)","journal-title":"Inf. Process. Lett."},{"key":"15_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":"15_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1998","unstructured":"Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. Syst. Sci.\u00a037, 367\u2013394 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR12","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)"},{"issue":"2","key":"15_CR13","first-page":"285","volume":"E86-D","author":"T. Takai","year":"2003","unstructured":"Takai, T., Seki, H., Fujinaka, Y., Kaji, Y.: Layered transducing term rewriting system and its recognizability preserving property. IEICE Transactions on Information and Systems\u00a0E86-D(2), 285\u2013295 (2003)","journal-title":"IEICE Transactions on Information and Systems"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:31Z","timestamp":1619518351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}