L. Barceló, L. Barceló, and . Libkin, Temporal Logics over Unranked Trees, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.31-40, 2005.
DOI : 10.1109/LICS.2005.51

. Bonatti, The Complexity of Enriched Mu-Calculi, Logical Methods in Computer Science, vol.4, issue.3, 2008.
DOI : 10.2168/LMCS-4(3:11)2008

. Calvanese, An automata-theoretic approach to regular XPath Node selection query languages for trees, DBPL AAAI Ghelli, L. Pardini, and C. Sartiani. Linear inclusion for XML regular expression types CIKM, pp.18-35, 2009.

]. S. Dal-zilio and D. Lugiez, XML Schema, Tree Logic and Sheaves Automata, RTA, 2003.
DOI : 10.1007/3-540-44881-0_18

URL : https://hal.archives-ouvertes.fr/hal-00109288

. Dal-zilio, A logic you can count on, POPL, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071562

. Demri, ]. S. Lugiez, D. Demri, and . Lugiez, Complexity of modal logics with Presburger constraints, Journal of Applied Logic, vol.8, issue.3, 2010.
DOI : 10.1016/j.jal.2010.03.001

]. W. Gelade, Succinctness of regular expressions with interleaving, intersection and counting, Theor. Comput. Sci, vol.411, pp.31-33, 2010.

. Genevès, Efficient static analysis of XML paths and types, PLDI, 2007.

. Hosoya, Regular expression types for XML, ACM Trans. Program. Lang. Syst, vol.27, issue.1, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00009271

. Seidl, Counting in Trees for Free, ICALP, 2004.
DOI : 10.1007/978-3-540-27836-8_94

URL : https://hal.archives-ouvertes.fr/hal-00159525

Y. Moshe and . Vardi, Reasoning about the past with two-way automata, ICALP, pp.628-641, 1998.