{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:11:05Z","timestamp":1771024265518,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_15","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"157-168","source":"Crossref","is-referenced-by-count":18,"title":["Expressive Power of Pebble Automata"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Samuelides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Segoufin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"A.V. Aho","year":"1971","unstructured":"Aho, A.V., Ullman Translations, J.D.: on a Context-Free Grammar. Information and Control\u00a019(5), 439\u2013475 (1971)","journal-title":"Information and Control"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"M.\u00a0Boja\u0144czyk and T.\u00a0Colcombet. Tree-Walking Automata Cannot Be Determinized. TCS (to appear)","DOI":"10.1007\/978-3-540-27836-8_23"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: STOC (2005)","DOI":"10.1145\/1060590.1060626"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-642-60207-8_7","volume-title":"Jewels are forever","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhum\u00e4ki, J., et al. (eds.) Jewels are forever, pp. 72\u201383. Springer, Heidelberg (1999)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_39","volume-title":"STACS 2006","author":"J. Engelfriet","year":"2006","unstructured":"Engelfriet, J., Hoogeboom, H.J.: Nested Pebbles and Transitive Closure. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, Springer, Heidelberg (2006)"},{"issue":"9","key":"15_CR6","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00236-003-0120-0","volume":"39","author":"J. Engelfriet","year":"2003","unstructured":"Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Inf.\u00a039(9), 613\u2013698 (2003)","journal-title":"Acta Inf."},{"issue":"1","key":"15_CR7","first-page":"51","volume":"14","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Hoogeboom, H.-J., Van Best, J.-P.: Trips on Trees. Acta Cybern.\u00a014(1), 51\u201364 (1999)","journal-title":"Acta Cybern."},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. Syst. Sci.\u00a066(1), 66\u201397 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR9","unstructured":"Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic tree-walking automata. In: IPL (to appear)"},{"key":"15_CR10","unstructured":"Comon, H., et al.: Tree Automata Techniques and Applications, available at \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:43Z","timestamp":1619493583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11786986_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}