{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:10Z","timestamp":1725505570815},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_1","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Finding Your Way in a Forest: On Different Types of Trees and Their Properties"],"prefix":"10.1007","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-540-31856-9_27","volume-title":"STACS 2005","author":"M. Benedikt","year":"2005","unstructured":"Benedikt, M., Segoufin, L.: Regular languages definable in FO. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 327\u2013339. Springer, Heidelberg (2005)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11538363_20","volume-title":"Computer Science Logic","author":"M. Benedikt","year":"2005","unstructured":"Benedikt, M., Segoufin, L.: Towards a characterization of order-invariant queries over tame structures. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 276\u2013291. Springer, Heidelberg (2005)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-74915-8_14","volume-title":"Computer Science Logic","author":"M. Bojanczyk","year":"2007","unstructured":"Bojanczyk, M.: Forest expressions. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 146\u2013160. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M.: Two-way unary temporal logic over trees. In: LICS 2007, pp. 121\u2013130 (2007)","DOI":"10.1109\/LICS.2007.51"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/1060590.1060626","volume-title":"STOC 2005","author":"M. Bojanczyk","year":"2005","unstructured":"Bojanczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: STOC 2005, pp. 234\u2013243. ACM, New York (2005)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1142351.1142354","volume-title":"PODS 2006","author":"M. Bojanczyk","year":"2006","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS 2006, pp. 10\u201319. ACM, New York (2006)"},{"issue":"2\u20133","key":"1_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2006.01.018","volume":"358","author":"M. Bojanczyk","year":"2006","unstructured":"Bojanczyk, M., Walukiewicz, I.: Characterizing EF and EX tree logics. Theoretical Computer Science\u00a0358(2\u20133), 255\u2013272 (2006)","journal-title":"Theoretical Computer Science"},{"key":"1_CR8","unstructured":"Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol.\u00a02, pp. 107\u2013132. Amsterdam University Press (2007)"},{"key":"1_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530098","volume-title":"The Logic of Typed Future Structures","author":"B. Carpenter","year":"1992","unstructured":"Carpenter, B.: The Logic of Typed Future Structures. Cambridge University Press, Cambridge (1992)"},{"key":"1_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, F.J.D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B.: The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sci.\u00a080(2), 153\u2013202 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR12","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\u2013walking pebble automata. In: Karhum\u00e4ki, J., et al. (eds.) Jewels are forever, pp. 72\u201383. Springer, Heidelberg (1999)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1265530.1265540","volume-title":"PODS 2007","author":"J. Engelfriet","year":"2007","unstructured":"Engelfriet, J., Hoogeboom, H.J., Samwel, B.: XML transformation by tree-walking transducers with invisible pebbles. In: PODS 2007, pp. 63\u201372. ACM, New York (2007)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-18088-5_22","volume-title":"Automata, Languages and Programming","author":"T. Hafer","year":"1987","unstructured":"Hafer, T., Thomas, W.: Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 269\u2013279. Springer, Heidelberg (1987)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/BFb0035840","volume-title":"STACS 88","author":"U. Heuter","year":"1988","unstructured":"Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol.\u00a0294, pp. 136\u2013148. Springer, Heidelberg (1988)"},{"key":"1_CR16","first-page":"131","volume-title":"LICS 2007","author":"M. Jurdzinski","year":"2007","unstructured":"Jurdzinski, M., Lazic, R.: Alternation-free modal mu-calculus for data trees. In: LICS 2007, pp. 131\u2013140. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/1166074.1166076","volume":"31","author":"W. Martens","year":"2006","unstructured":"Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML schema. ACM Trans. Database Syst.\u00a031(3), 770\u2013813 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski, D.: Fixed points vs. infinite generation. In: LICS 1988, pp. 402\u2013409 (1988)","DOI":"10.1109\/LICS.1988.5137"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","first-page":"125","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"A. Potthoff","year":"1995","unstructured":"Potthoff, A.: First-order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 125\u2013139. Springer, Heidelberg (1995)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control\u00a08, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","first-page":"31","volume-title":"Automata, Languages, and Programming","author":"W. Thomas","year":"1984","unstructured":"Thomas, W.: Logical aspects in the study of tree languages. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 31\u201350. Springer, Heidelberg (1984)"},{"key":"1_CR22","volume-title":"PODS 2001","author":"V. Vianu","year":"2001","unstructured":"Vianu, V.: A web odyssey: From CODD to XML. In: PODS 2001, ACM, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:26Z","timestamp":1619521886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_1","relation":{},"subject":[]}}