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

M. Benedikt and C. Koch, XPath leashed, ACM Computing Surveys, vol.41, issue.1, 2008.
DOI : 10.1145/1456650.1456653
URL : https://infoscience.epfl.ch/record/166852/files/25-leashed.pdf

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

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.

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, 2009.
DOI : 10.1145/1559795.1559827

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, 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

D. Figueira, Alternating register automata on finite data words and trees, Logical Methods in Computer Science, vol.8, issue.122, p.2012
DOI : 10.2168/lmcs-8(1:22)2012
URL : https://lmcs.episciences.org/907/pdf

D. Figueira, On XPath with transitive axes and data tests, Proceedings of the 32nd symposium on Principles of database systems, PODS '13, p.2013
DOI : 10.1145/2463664.2463675

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, Intl. Symp. on Mathematical Foundations of Computer Science (MFCS'09), 2009.
DOI : 10.1016/S0020-0190(01)00337-4
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs09.pdf

D. Figueira and L. Segoufin, Bottom-up automata on data trees and vertical XPath [GF05] Floris Geerts and Wenfei Fan. Satisfiability of XPath queries with sibling axes, International Symposium on Theoretical Aspects of Computer Science Intl. Symp. on Database Programming Languages (DBPL'05), pp.93-104, 2005.

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

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

L. Marvin and . Minsky, Computation: finite and infinite machines [tCL09] Balder ten Cate and Carsten Lutz. The complexity of query containment in expressive fragments of XPath 2.0, Journal of the ACM, vol.56, issue.6, 1967.