{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:01:31Z","timestamp":1767927691103,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221531","type":"print"},{"value":"9783540259794","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_6","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"85-94","source":"Crossref","is-referenced-by-count":31,"title":["Matchbox: A Tool for Match-Bounded String Rewriting"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Waldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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)"},{"issue":"1\u20132","key":"6_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. J. Symbolic Comput.\u00a03(1\u20132), 69\u2013115 (1987)","journal-title":"J. Symbolic Comput."},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1137\/S009753979833297X","volume":"31","author":"A. Geser","year":"2002","unstructured":"Geser, A.: Decidability of Termination of Grid String Rewriting Rules. SIAM J. Comput.\u00a031(4), 1156\u20131168 (2002)","journal-title":"SIAM J. Comput."},{"key":"6_CR4","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":"6_CR5","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems and automated termination proofs. In: Rubio, A. (ed.) Proc. 6th Int. Workshop on Termination WST-03, Technical Report DSIC-II\/15\/03, Universidad Polit\u00e9cnica de Valencia, Spain, pp. 19\u201322 (2003)"},{"key":"6_CR6","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":"6_CR7","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Termination proofs for string rewriting systems via inverse match-bounds. NIA Report 2003-XX, National Institute of Aerospace, Hampton, VA, USA., Available at http:\/\/research.nianet.org\/~geser\/papers\/nia-inverse.html"},{"key":"6_CR8","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Deciding Termination for Ancestor Match-Bounded String Rewriting Systems. submitted to RTA-04"},{"issue":"3","key":"6_CR9","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":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","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, pp. 337\u2013348. Springer, Heidelberg (2003)"},{"key":"6_CR11","unstructured":"Lankford, D.S., Musser, D.R.: A finite termination criterion. Technical Report, Information Sciences Institute, Univ. of Southern California, Marina-del-Rey, CA (1978)"},{"key":"6_CR12","unstructured":"Rahn, M., Waldmann, J.: The Leipzig autotool System for Grading Student Homework. In: Hanus, M., Krishnamurthi, S., Thompson, S. (eds.) Proc. Functional and Declarative Programming in Education FDPE-02. Technical Report No. 0210, Universitt Kiel (2002)"},{"key":"6_CR13","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":"6_CR14","doi-asserted-by":"crossref","unstructured":"Zantema, H.: TORPA: Termination Of Rewriting Proved Automatically, version 1.2 (2004), Available at http:\/\/www.win.tue.nl\/~hzantema\/torpa.html","DOI":"10.1007\/978-3-540-25979-4_7"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:02:44Z","timestamp":1559664164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}