{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:17:57Z","timestamp":1725596277690},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_16","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"166-177","source":"Crossref","is-referenced-by-count":1,"title":["Loops and Overloops for Tree Walking Automata"],"prefix":"10.1007","author":[{"given":"Pierre-Cyrille","family":"H\u00e9am","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Hugot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kouchnarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"A. Aho","year":"1969","unstructured":"Aho, A., Ullman, J.: Translations on a context free grammar. Information and Control\u00a019(5), 439\u2013475 (1969)","journal-title":"Information and Control"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-24597-1_6","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"M. Boja\u0144czyk","year":"2003","unstructured":"Boja\u0144czyk, M.: 1-bounded TWA cannot be determinized. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 62\u201373. Springer, Heidelberg (2003)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88282-4_1","volume-title":"Language and Automata Theory and Applications","author":"M. Boja\u0144czyk","year":"2008","unstructured":"Boja\u0144czyk, M.: Tree-walking automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 1\u20132. Springer, Heidelberg (2008), \n                    \n                      http:\/\/www.mimuw.edu.pl\/~bojan\/papers\/twasurvey.pdf"},{"issue":"2-3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2005.10.031","volume":"350","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. Theoretical Computer Science\u00a0350(2-3), 164\u2013173 (2006)","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","first-page":"234","volume-title":"STOC 2005","author":"M. Boja\u0144czyk","year":"2005","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: STOC 2005, pp. 234\u2013243. ACM Press, New York (2005)"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/1706591.1706598","volume":"57","author":"B. Cate ten","year":"2010","unstructured":"ten Cate, B., Segoufin, L.: Transitive closure logic, nested tree walking automata, and XPath. J. ACM\u00a057(3), 251\u2013260 (2010)","journal-title":"J. ACM"},{"key":"16_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)"},{"key":"16_CR8","first-page":"477","volume-title":"STOC 1988","author":"S. Cosmadakis","year":"1988","unstructured":"Cosmadakis, S., Gaifman, H., Kanellakis, P., Vardi, M.: Decidable optimization problems for database logic programs. In: STOC 1988, pp. 477\u2013490. ACM Press, New York (1988)"},{"key":"16_CR9","unstructured":"Heam, P., Hugot, V., Kouchnarenko, O.: Random Generation of Positive TAGEDs wrt. the Emptiness Problem. Tech. Rep. RR-7441, INRIA (November 2010)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-02979-0_15","volume-title":"Implementation and Application of Automata","author":"P.-C. H\u00e9am","year":"2009","unstructured":"H\u00e9am, P.-C., Nicaud, C., Schmitz, S.: Random generation of deterministic tree (Walking) automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 115\u2013124. Springer, Heidelberg (2009)"},{"issue":"2","key":"16_CR11","first-page":"95","volume":"5","author":"D. Knuth","year":"1971","unstructured":"Knuth, D.: Semantics of context-free languages: Correction. Theory of Computing Systems\u00a05(2), 95\u201396 (1971)","journal-title":"Theory of Computing Systems"},{"key":"16_CR12","unstructured":"Samuelides, M.: Automates d\u2019arbres \u00e0 jetons. Ph.D. thesis, Universit\u00e9 Paris-Diderot - Paris VII (December 2007), \n                    \n                      http:\/\/tel.archives-ouvertes.fr\/tel-00255024\/en\/"},{"key":"16_CR13","first-page":"53","volume-title":"PODS","author":"L. Segoufin","year":"2002","unstructured":"Segoufin, L., Vianu, V.: Validating Streaming XML Documents. In: Popa, L. (ed.) PODS, pp. 53\u201364. ACM, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22256-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:06:38Z","timestamp":1553929598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}