{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:58:23Z","timestamp":1649048303732},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2009,10]]},"abstract":"<jats:p>This paper addresses the following general problem of tree regular model-checking: decide whether [Formula: see text] where [Formula: see text] is the reflexive and transitive closure of a successor relation induced by a term rewriting system [Formula: see text], and [Formula: see text] and [Formula: see text] are both regular tree languages. We develop an automatic approximation-based technique to handle this \u2013 undecidable in general \u2013 problem in the case when term rewriting system rules are non left-linear.<\/jats:p>","DOI":"10.1142\/s0129054109006917","type":"journal-article","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T15:33:52Z","timestamp":1253720032000},"page":"837-849","source":"Crossref","is-referenced-by-count":1,"title":["HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA"],"prefix":"10.1142","volume":"20","author":[{"given":"YOHAN","family":"BOICHUT","sequence":"first","affiliation":[{"name":"LIFO Bat. 3IA Universit\u00e9 d'Orl\u00e9ans Rue L\u00e9onard de Vinci B.P. 6759 F-45067 ORLEANS, France"}]},{"given":"ROMEO","family":"COURBIS","sequence":"additional","affiliation":[{"name":"INRIA-CASSIS LIFC, Universit\u00e9 de Franche-Comt\u00e9, 16 route de Gray, 25000 Besan\u00e7on, France"}]},{"given":"PIERRE-CYRILLE","family":"HEAM","sequence":"additional","affiliation":[{"name":"LSV, CNRS-INRIA, Ecole Normale Sup\u00e9rieure de Cachan, 61 avenue du Pr\u00e9sident Wilson, 94230 Cachan, France"}]},{"given":"OLGA","family":"KOUCHNARENKO","sequence":"additional","affiliation":[{"name":"INRIA-CASSIS LIFC, Universit\u00e9 de Franche-Comt\u00e9, 16 route de Gray, 25000 Besan\u00e7on, France"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_47"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.03.012"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_46"},{"key":"rf12","volume-title":"Tree Automata Techniques and Applications","author":"Comon H.","year":"2002"},{"key":"rf14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCS-2006-14101","volume":"14","author":"Cortier V.","journal-title":"Journal of Computer Security"},{"key":"rf16","doi-asserted-by":"crossref","unstructured":"N.\u00a0Dershowitz and J.P.\u00a0Jouannaud, Handbook of Theoretical Computer Science, Rewrite Systems (Elsevier Science Publishers B. V, 1990)\u00a0pp. 244\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"rf17","volume":"33","author":"Feuillade G.","journal-title":"Journal of Automated Reasonning"},{"key":"rf19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"Gilleron R.","journal-title":"Fundamenta Informatica"},{"key":"rf21","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J.","year":"1979"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.07.017"},{"key":"rf25","volume":"70","author":"R\u00e9ty P.","journal-title":"Electr. Notes Theor. Comput. Sci"},{"key":"rf26","first-page":"37","author":"Salomaa K.","journal-title":"JCSS: Journal of Computer and System Sciences"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054109006917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T11:42:31Z","timestamp":1590147751000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054109006917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":13,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,10]]}},"alternative-id":["10.1142\/S0129054109006917"],"URL":"https:\/\/doi.org\/10.1142\/s0129054109006917","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}