{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T01:54:22Z","timestamp":1790906062653,"version":"4.1.0"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>Tree-walking automata are a natural sequential model for recognizing tree languages. It is well known that every tree language recognized by a tree-walking automaton is regular. We show that the converse does not hold.<\/jats:p>","DOI":"10.1137\/050645427","type":"journal-article","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T18:05:05Z","timestamp":1211565905000},"page":"658-701","source":"Crossref","is-referenced-by-count":26,"title":["Tree-Walking Automata Do Not Recognize All Regular Languages"],"prefix":"10.1137","volume":"38","author":[{"given":"Miko\u0141aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Colcombet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2008,5,23]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90706-6"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"M. Boja\u0144czyk, 1\n                      -bounded TWA cannot be determinized\n                      , in Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 2914, Springer-Verlag, Berlin, 2003, pp. 62\u201373.","DOI":"10.1007\/978-3-540-24597-1_6"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.031"},{"key":"R4","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi,\n                      Tree Automata Techniques and Applications\n                      , http:\/\/www.grappa.univ-lille3.fr\/tata (October 1, 2002)."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"J. Engelfriet and H. J. Hoogeboom,\n                      Tree-walking pebble automata\n                      , in Jewels Are Forever, Contributions to Theoretical Computer Science in Honor of Arto Salomaa, J. Karhumaki, H. Maurer, G. Paun, and G. Rozenberg, eds., Springer-Verlag, Berlin, 1999, pp. 72\u201383.","DOI":"10.1007\/978-3-642-60207-8_7"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"J. Engelfriet and H. J. Hoogeboom,\n                      Automata with nested pebbles capture first-order logic with transitive closure\n                      , Log. Methods Comput. Sci., 3 (2) (2007), paper 3.","DOI":"10.2168\/LMCS-3(2:3)2007"},{"key":"R7","first-page":"51","volume":"14","author":"Engelfriet J.","year":"1999","journal-title":"Acta Cybernet.","ISSN":"https:\/\/id.crossref.org\/issn\/0324-721X","issn-type":"print"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90058-6"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(81)90438-1"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.09.017"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00013-0"},{"key":"R12","unstructured":"A. Potthoff,\n                      Logische Klassifizierung regul\u00e4rer Baumsprachen\n                      , Ph.D. thesis, Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Kiel, Germany, 1994."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/050645427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:20:28Z","timestamp":1787336428000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/050645427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1137\/050645427"],"URL":"https:\/\/doi.org\/10.1137\/050645427","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}