{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T13:45:48Z","timestamp":1774619148579,"version":"3.50.1"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p> The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a top-down interpretation of tree automata. In this paper, we propose new constructions based on Gluskov\u2019s one and on the one by Ilie and Yu using a bottom-up interpretation. One of the main goals of this technique is to consider as a next step the links with deterministic recognizers, something which cannot be done with classical top-down approaches. <\/jats:p>","DOI":"10.1142\/s0129054120420034","type":"journal-article","created":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:59:04Z","timestamp":1609207144000},"page":"1051-1068","source":"Crossref","is-referenced-by-count":2,"title":["The Bottom-Up Position Tree Automaton and the Father Automaton"],"prefix":"10.1142","volume":"31","author":[{"given":"Samira","family":"Attou","sequence":"first","affiliation":[{"name":"USTHB, Faculty of Mathematics, RECITS Laboratory, BP 32, El Alia, 16111 Bab Ezzouar, Algiers, Algeria"},{"name":"Groupe de Recherche Rouennais en Informatique Fondamentale, Universit\u00e9 de Rouen Normandie, Avenue de l\u2019Universit\u00e9, 76801 Saint-\u00c9tienne-du-Rouvray, France"}]},{"given":"Ludovic","family":"Mignot","sequence":"additional","affiliation":[{"name":"USTHB, Faculty of Mathematics, RECITS Laboratory, BP 32, El Alia, 16111 Bab Ezzouar, Algiers, Algeria"},{"name":"Groupe de Recherche Rouennais en Informatique Fondamentale, Universit\u00e9 de Rouen Normandie, Avenue de l\u2019Universit\u00e9, 76801 Saint-\u00c9tienne-du-Rouvray, France"}]},{"given":"Djelloul","family":"Ziadi","sequence":"additional","affiliation":[{"name":"USTHB, Faculty of Mathematics, RECITS Laboratory, BP 32, El Alia, 16111 Bab Ezzouar, Algiers, Algeria"},{"name":"Groupe de Recherche Rouennais en Informatique Fondamentale, Universit\u00e9 de Rouen Normandie, Avenue de l\u2019Universit\u00e9, 76801 Saint-\u00c9tienne-du-Rouvray, France"}]}],"member":"219","published-online":{"date-parts":[[2020,12,28]]},"reference":[{"key":"S0129054120420034BIB001","series-title":"Mathematics and Its Applications","volume-title":"Automata and Algebras in Categories","author":"Ad\u00e1mek J.","year":"1990"},{"issue":"2","key":"S0129054120420034BIB002","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"Antimirov V. M.","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"S0129054120420034BIB003","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-319-94812-6_6","volume-title":"CIAA","volume":"10977","author":"Attou S.","year":"2018"},{"key":"S0129054120420034BIB004","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1007\/978-3-540-28629-5_69","volume-title":"MFCS","volume":"3153","author":"Bouchou B.","year":"2004"},{"key":"S0129054120420034BIB005","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-319-62809-7_9","volume-title":"DLT","volume":"10396","author":"Broda S.","year":"2017"},{"issue":"2","key":"S0129054120420034BIB006","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"Br\u00fcggemann-Klein A.","year":"1998","journal-title":"Inf. Comput."},{"issue":"1","key":"S0129054120420034BIB007","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0304-3975(97)00296-X","volume":"233","author":"Caron P.","year":"2000","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"S0129054120420034BIB008","first-page":"243","volume":"22","author":"Champarnaud J.","year":"2017","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"S0129054120420034BIB009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"Glushkov V. M.","year":"1961","journal-title":"Russian Mathematical Surveys"},{"issue":"37","key":"S0129054120420034BIB010","doi-asserted-by":"crossref","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","volume":"410","author":"H\u00f6gberg J.","year":"2009","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"S0129054120420034BIB011","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"Hromkovic J.","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"S0129054120420034BIB012","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"Ilie L.","year":"2003","journal-title":"Inf. Comput."},{"issue":"3","key":"S0129054120420034BIB013","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1051\/ita\/2011107","volume":"45","author":"Kuske D.","year":"2011","journal-title":"RAIRO \u2014 Theor. Inf. Appl."},{"key":"S0129054120420034BIB014","first-page":"395","volume-title":"LATA 2013","author":"Laugerotte \u00c9.","year":"2013"},{"key":"S0129054120420034BIB015","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"McNaughton R. F.","year":"1960","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"1","key":"S0129054120420034BIB017","doi-asserted-by":"crossref","first-page":"69","DOI":"10.3233\/FI-2017-1598","volume":"156","author":"Mignot L.","year":"2017","journal-title":"Fundam. Inform."},{"key":"S0129054120420034BIB018","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/978-3-642-00982-2_53","volume-title":"LATA","volume":"5457","author":"Nicaud C.","year":"2009"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120420034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T03:33:41Z","timestamp":1611200021000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120420034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":17,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.1142\/S0129054120420034"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120420034","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}