Abstract
We see trees in almost any part of computer science. Traditionally, ranked trees, that are nothing else but terms, captured most attention, although exceptions could have been found in graph theory or linguistics [9]. Recently unranked trees are a subject of renewed interest, mainly because of the developement of XML [22]. It is also quite comon nowadays to see trees with infinite paths, especailly in the context of verification. We will omit this aspect, as for the questions we want to discuss finite trees are sufficiently interesting. We prefer instead to make distinction between ordered and unordered trees, i.e., distinguish situations when syblings are ordered or not. Thus we will deal with four types of trees depending on two parameters: ranked/unranked, and ordered/unordered.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Benedikt, M., Segoufin, L.: Regular languages definable in FO. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 327–339. Springer, Heidelberg (2005)
Benedikt, M., Segoufin, L.: Towards a characterization of order-invariant queries over tame structures. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 276–291. Springer, Heidelberg (2005)
Bojanczyk, M.: Forest expressions. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 146–160. Springer, Heidelberg (2007)
Bojanczyk, M.: Two-way unary temporal logic over trees. In: LICS 2007, pp. 121–130 (2007)
Bojanczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: STOC 2005, pp. 234–243. ACM, New York (2005)
Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS 2006, pp. 10–19. ACM, New York (2006)
Bojanczyk, M., Walukiewicz, I.: Characterizing EF and EX tree logics. Theoretical Computer Science 358(2–3), 255–272 (2006)
Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol. 2, pp. 107–132. Amsterdam University Press (2007)
Carpenter, B.: The Logic of Typed Future Structures. Cambridge University Press, Cambridge (1992)
Comon, H., Dauchet, M., Gilleron, R., Lugiez, F.J.D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http://www.grappa.univ-lille3.fr/tata/
Courcelle, B.: The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sci. 80(2), 153–202 (1991)
Engelfriet, J., Hoogeboom, H.J.: Tree–walking pebble automata. In: Karhumäki, J., et al. (eds.) Jewels are forever, pp. 72–83. Springer, Heidelberg (1999)
Engelfriet, J., Hoogeboom, H.J., Samwel, B.: XML transformation by tree-walking transducers with invisible pebbles. In: PODS 2007, pp. 63–72. ACM, New York (2007)
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. 267, pp. 269–279. Springer, Heidelberg (1987)
Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 136–148. Springer, Heidelberg (1988)
Jurdzinski, M., Lazic, R.: Alternation-free modal mu-calculus for data trees. In: LICS 2007, pp. 131–140. IEEE Computer Society Press, Los Alamitos (2007)
Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML schema. ACM Trans. Database Syst. 31(3), 770–813 (2006)
Niwiński, D.: Fixed points vs. infinite generation. In: LICS 1988, pp. 402–409 (1988)
Potthoff, A.: First-order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) TAPSOFT 1995. LNCS, vol. 915, pp. 125–139. Springer, Heidelberg (1995)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Thomas, W.: Logical aspects in the study of tree languages. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 31–50. Springer, Heidelberg (1984)
Vianu, V.: A web odyssey: From CODD to XML. In: PODS 2001, ACM, New York (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walukiewicz, I. (2008). Finding Your Way in a Forest: On Different Types of Trees and Their Properties. In: Amadio, R. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2008. Lecture Notes in Computer Science, vol 4962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78499-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-78499-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78497-5
Online ISBN: 978-3-540-78499-9
eBook Packages: Computer ScienceComputer Science (R0)