{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:00Z","timestamp":1725549180244},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_13","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T11:39:36Z","timestamp":1267443576000},"page":"134-145","source":"Crossref","is-referenced-by-count":1,"title":["Finding Finite Automata That Certify Termination of String Rewriting"],"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":"13_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","volume":"19","author":"R.V. Book","year":"1982","unstructured":"Book, R.V., Jantzen, M., Wrathall, C.: Monadic Thue systems. Theoret. Comput. Sci.\u00a019, 231\u2013251 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0020-0190(85)90122-X","volume":"20","author":"R.V. Book","year":"1985","unstructured":"Book, R.V., Otto, F.: Cancellation rules and extended word problems. Inform. Process. Lett.\u00a020, 5\u201311 (1985)","journal-title":"Inform. Process. Lett."},{"key":"13_CR3","volume-title":"Texts and Monographs in Computer Science","author":"R.V. Book","year":"1993","unstructured":"Book, R.V., Otto, F.: String-Rewriting Systems. In: Texts and Monographs in Computer Science. Springer, New York (1993)"},{"key":"13_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":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-45138-9_39","volume-title":"Mathematical Foundations of Computer Science 2003","author":"A. Geser","year":"2003","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 449\u2013459. Springer, Heidelberg (2003)"},{"key":"#cr-split#-13_CR6.1","doi-asserted-by":"crossref","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. NIA Report 2003-09, National Institute of Aerospace, Hampton, VA, USA, Available at: http:\/\/research.nianet.org\/~geser\/papers\/nia-matchbounded.html;","DOI":"10.1007\/978-3-540-45138-9_39"},{"key":"#cr-split#-13_CR6.2","unstructured":"Accepted for Appl. Algebra Engrg. Comm. Comput."},{"key":"13_CR7","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), Tool and description available at: http:\/\/www-i2.informatik.rwth-aachen.de\/AProVE\/"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/321832.321842","volume":"21","author":"T.N. Hibbard","year":"1974","unstructured":"Hibbard, T.N.: Context-limited grammars. J. ACM\u00a021(3), 446\u2013453 (1974)","journal-title":"J. ACM"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45007-6_27","volume-title":"Developments in Language Theory","author":"D. Hofbauer","year":"2003","unstructured":"Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710. Springer, Heidelberg (2003); Accepted for Theoret. Comput. Sci."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-63890-3_26","volume-title":"Algorithms and Computation","author":"B. Ravikumar","year":"1997","unstructured":"Ravikumar, B.: Peg-solitaire, string rewriting systems and finite automata. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 233\u2013242. Springer, Heidelberg (1997)"},{"key":"13_CR11","first-page":"1201","volume":"323","author":"E. Tahhan Bittar","year":"1996","unstructured":"Tahhan Bittar, E.: Complexit\u00e9 lin\u00e9aire du probl\u00e9me de Zantema. C. R. Acad. Sci. Paris S\u00e9r. I Inform. Th\u00e9or., t.\u00a0323, 1201\u20131206 (1996)","journal-title":"I Inform. Th\u00e9or., t."},{"key":"13_CR12","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), Tool and description available at: http:\/\/theo1.informatik.uni-leipzig.de\/matchbox\/"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002009900019","volume":"11","author":"H. Zantema","year":"2000","unstructured":"Zantema, H., Geser, A.: A complete characterization of termination of 0p1q \u2192 1r0s. Appl. Algebra Engrg. Comm. Comput.\u00a011(1), 1\u201325 (2000)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"13_CR14","first-page":"181","volume-title":"Term Rewriting Systems, by Terese","author":"H. Zantema","year":"2003","unstructured":"Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181\u2013259. Cambridge University Press, Cambridge (2003)"},{"key":"13_CR15","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), Tool and description available at: http:\/\/www.win.tue.nl\/~hzantema\/torpa.html"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Zantema, H.: Termination of string rewriting proved automatically. Accepted for J. Automat. Reason. (2004)","DOI":"10.1007\/978-3-540-25979-4_7"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:57:08Z","timestamp":1605743828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}