{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:12Z","timestamp":1725566652657},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_26","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"353-367","source":"Crossref","is-referenced-by-count":5,"title":["On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Alfons","family":"Geser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Hofbauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Waldmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"26_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997\u20132001), Available at http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"key":"26_CR3","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: Proving Termination of Rewriting with CiME. In: Rubio, A. (ed.) Proc. 6th Int. Workshop on Termination WST 2003, Universidad Polit\u00e9cnica de Valencia, Spain. Technical Report DSIC II\/15\/03, pp. 71\u201373 (2003)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-10843-2_36","volume-title":"Automata, Languages and Programming","author":"N. Dershowitz","year":"1981","unstructured":"Dershowitz, N.: Termination of linear rewriting systems. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 448\u2013458. Springer, Heidelberg (1981)"},{"key":"26_CR5","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Rewriting Techniques and Applications","author":"T. Genet","year":"1998","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 151\u2013165. Springer, Heidelberg (1998)"},{"issue":"3-4","key":"26_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Appl. Algebra Engrg. Comm. Comput.\u00a015(3-4), 149\u2013171 (2004)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"26_CR8","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Tree automata that certify termination of term rewriting systems. In: Codish, M., Middeldorp, A. (eds.) Proc. 7th Int. Workshop on Termination WST-04, Aachener Informatik Berichte AIB-2004-07, RWTH Aachen, Gemany, pp. 14\u201317 (2004)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Tree automata that certify termination of left-linear term rewriting systems (2005), Full version available at http:\/\/www.imn.htwk-leipzig.de\/~waldmann\/pub\/rta05\/","DOI":"10.1007\/978-3-540-32033-3_26"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-30500-2_13","volume-title":"Implementation and Application of Automata","author":"A. Geser","year":"2005","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Finding finite automata that certify termination of string rewriting. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 134\u2013145. Springer, Heidelberg (2005)"},{"key":"26_CR11","unstructured":"Geupel, O.: Overlap closures and termination of term rewriting systems. Technical Report MIP-8922, Universit\u00e4t Passau, Germany (1989)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-44881-0_22","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Tsukuba Termination Tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 311\u2013320. Springer, Heidelberg (2003)"},{"key":"26_CR14","unstructured":"Lankford, D.S., Musser, D.R.: A finite termination criterion. Unpublished draft, Information Sciences Institute, University of Southern California, Marina-del-Rey, CA (1978)"},{"key":"26_CR15","unstructured":"March\u00e9, C., Rubio, A. (eds.): Termination Problems Data Base (2004), http:\/\/www.lri.fr\/~marche\/wst2004-competition\/tpdb.html"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Middeldorp, A.: Approximations for strategies and termination. In: Proc. 2nd Int. Workshop on Reduction Strategies in Rewriting and Programming. Electron. Notes Theor. Comput. Sci, vol.\u00a070(6) (2002)","DOI":"10.1016\/S1571-0661(04)80598-X"},{"key":"26_CR17","first-page":"301","volume-title":"Terese, Term Rewriting Systems","author":"V. Oostrom van","year":"2003","unstructured":"van Oostrom, V., de Vrijer, R.: Equivalences of Reductions. In: Terese, Term Rewriting Systems, pp. 301\u2013474. Cambridge Univ. Press, Cambridge (2003)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-25979-4_6","volume-title":"Rewriting Techniques and Applications","author":"J. Waldmann","year":"2004","unstructured":"Waldmann, J.: Matchbox: a tool for match-bounded string rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 85\u201394. Springer, Heidelberg (2004)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-25979-4_7","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"2004","unstructured":"Zantema, H.: TORPA: Termination of rewriting proved automatically. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 95\u2013104. Springer, Heidelberg (2004)"},{"key":"26_CR20","first-page":"181","volume-title":"Terese, Term Rewriting Systems","author":"H. Zantema","year":"2003","unstructured":"Zantema, H.: Termination. In: Terese, Term Rewriting Systems, pp. 181\u2013259. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:33:59Z","timestamp":1605760439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}