[. Abdulla, B. Jonsson, and Y. Tsay, General decidability theorems for infinite-state systems, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.313-321, 1996.
DOI : 10.1109/LICS.1996.561359
URL : http://www.docs.uu.se/docs/avds/general.ps

R. Alur and D. L. Dill, A theory of timed automata, International Colloquium on Automata, Languages and Programming (ICALP'05), pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8
URL : https://doi.org/10.1016/0304-3975(94)90010-8

M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, Journal of the ACM, vol.55, issue.2, pp.1-79, 2008.
DOI : 10.1145/1346330.1346333

A. Mikoo-laj-boja´nczykboja´nczyk, T. Muscholl, L. Schwentick, and . Segoufin, Two-variable logic on data trees and XML reasoning, Journal of the ACM, vol.56, issue.3, pp.1-48, 2009.
DOI : 10.1145/1516512.1516515

J. Clark and S. Derose, XML path language (XPath) Website, 1999. W3C Recommendation

P. Chambart and P. Schnoebelen, The Ordinal Recursive Complexity of Lossy Channel Systems, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.205-216, 2008.
DOI : 10.1109/LICS.2008.47

E. Leonard and . Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, The American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913.

S. Demri and R. Lazi´clazi´c, LTL with the freeze quantifier and register automata, ACM Transactions on Computational Logic, vol.10, issue.3, 2009.
DOI : 10.1109/lics.2006.31
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-lics2006.pdf

S. Demri, R. Lazi´clazi´c, and D. Nowak, On the freeze quantifier in constraint LTL: Decidability and complexity, International Symposium on Temporal Representation and Reasoning (TIME'05), pp.113-121, 2005.
DOI : 10.1016/j.ic.2006.08.003
URL : https://doi.org/10.1016/j.ic.2006.08.003

D. Figueira, S. Figueira, S. Schmitz, and P. Schnoebelen, Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011.
DOI : 10.1109/LICS.2011.39
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FFSS-arxiv10.pdf

D. Figueira, P. Hofman, and . Lasota, Relating timed and register automata, International Workshop on Expressiveness in Concurrency (EXPRESS'10), 2010.
DOI : 10.4204/eptcs.41.5
URL : https://hal.archives-ouvertes.fr/hal-01806104

D. Figueira, Satisfiability of downward XPath with data equality tests, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.197-206, 2009.
DOI : 10.1145/1559795.1559827
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-pods09.pdf

D. Figueira, Forward-XPath and extended register automata on data-trees, Proceedings of the 13th International Conference on Database Theory, ICDT '10, 2010.
DOI : 10.1145/1804669.1804699
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-icdt10.pdf

D. Figueira, Reasoning on Words and Trees with Data, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00718605

D. Figueira, A Decidable Two-Way Logic on Data Words, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011.
DOI : 10.1109/LICS.2011.18
URL : http://homepages.inf.ed.ac.uk/dfigueir/etc/lics11.pdf

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere! Theoretical Computer Science, pp.63-92, 2001.
DOI : 10.1016/s0304-3975(00)00102-x
URL : https://doi.org/10.1016/s0304-3975(00)00102-x

D. Figueira and L. Segoufin, Future-Looking Logics on Data Words and Trees, International Symposium on Mathematical Foundations of Computer Science (MFCS'09), pp.331-343, 2009.
DOI : 10.1016/S0020-0190(01)00337-4
URL : https://hal.archives-ouvertes.fr/hal-01806188

D. Figueira and L. Segoufin, Bottom-up automata on data trees and vertical XPath, International Symposium on Theoretical Aspects of Computer Science (STACS'11, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01631219

F. Geerts and W. Fan, Satisfiability of XPath Queries with Sibling Axes, International Symposium on Database Programming Languages (DBPL'05), pp.122-137, 2005.
DOI : 10.1007/11601524_8
URL : http://homepages.inf.ed.ac.uk/fgeerts/pdf/trondheim05.pdf

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, ACM Transactions on Database Systems, vol.30, issue.2, pp.444-491, 2005.
DOI : 10.1145/1071610.1071614
URL : http://www.cs.cornell.edu/~koch/download/vldb2002-post.pdf

G. Higman, Ordering by Divisibility in Abstract Algebras, Proceedings of the London Mathematical Society, vol.3, issue.1, pp.326-336, 1952.
DOI : 10.1112/plms/s3-2.1.326

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternation-free modal mu-calculus for data trees, Annual IEEE Symposium on Logic in Computer Science (LICS'07), pp.131-140, 2007.

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternating automata on data trees and XPath satisfiability, ACM Transactions on Computational Logic, vol.12, issue.3, p.19, 2011.

J. B. Kruskal, Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture . Transactions of the, pp.210-225, 1960.
DOI : 10.2307/1993287

M. H. Löb and S. S. Wainer, Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung, pp.39-51, 1970.

M. Marx, XPath with Conditional Axis Relations, International Conference on Extending Database Technology, pp.477-494, 2004.
DOI : 10.1007/978-3-540-24741-8_28
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-24741-8_28.pdf

P. Schnoebelen, Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets, International Symposium on Mathematical Foundations of Computer Science (MFCS'10 ACM Symposium on Principles of Database Systems (PODS'06), pp.616-628, 2010.
DOI : 10.1007/978-3-642-15155-2_54
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf