{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:25:33Z","timestamp":1648653933713},"reference-count":21,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p> We present a technique based on the construction of finite automata to prove termination of string rewriting systems. Using this technique the tools Matchbox and TORPA are able to prove termination of particular string rewriting systems completely automatically for which termination was considered to be very hard until recently. <\/jats:p>","DOI":"10.1142\/s0129054105003108","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T10:52:13Z","timestamp":1120560733000},"page":"471-486","source":"Crossref","is-referenced-by-count":6,"title":["FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS"],"prefix":"10.1142","volume":"16","author":[{"given":"ALFONS","family":"GESER","sequence":"first","affiliation":[{"name":"National Institute of Aerospace, 144 Research Drive, Hampton, Virginia 23666, USA"}]},{"given":"DIETER","family":"HOFBAUER","sequence":"additional","affiliation":[{"name":"M\u00fchlengasse 16, D-34125 Kassel, Germany"}]},{"given":"JOHANNES","family":"WALDMANN","sequence":"additional","affiliation":[{"name":"Hochschule f\u00fcr Technik, Wirtschaft und Kultur (FH) Leipzig, Fb IMN, PF 30 11 66, D-04251 Leipzig, Germany"}]},{"given":"HANS","family":"ZANTEMA","sequence":"additional","affiliation":[{"name":"Faculteit Wiskunde en Informatica, Technische Universiteit Eindhoven, Postbus 513, 5600 MB Eindhoven, The Netherlands"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90036-6"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90122-X"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028014"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10843-2_36"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56868-9_16"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052368"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45138-9_39"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-004-0162-8"},{"key":"rf10","unstructured":"A.\u00a0Gesser, Proc. 9th Int. Conf. Implementation and Application of Automata CIAA-04, Lecture Notes in Comput. Sci.\u00a03317, eds. M.\u00a0Domaratzki (Springer-Verlag, 2004)\u00a0pp. 134\u2013145."},{"key":"rf11","series-title":"Lecture Notes in Comp. Sci.","volume-title":"Proc. 16th Int. Conf. Rewriting Techniques and Applications RTA05","author":"Geser A.","year":"2005"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_15"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321842"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.009"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63890-3_26"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61464-8_61"},{"key":"rf18","first-page":"1201","author":"Tahhan Bittar E.","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Inform. Th\u00e9or."},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_6"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/s002009900019"},{"key":"rf21","unstructured":"H.\u00a0Zantema, Term Rewriting Systems, ed. \u00a0Terese (Cambridge Univ. Press, 2003)\u00a0pp. 181\u2013259."},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_7"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:39:35Z","timestamp":1565123975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":21,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S0129054105003108"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003108","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}