A. Berlea, On-the-fly tuple selection for XQuery, Proceedings of the 4th international workshop on XQuery implementation, experience and perspectives , XIME-P '07, 2007.
DOI : 10.1145/1328158.1328160

M. Bojanczyk, A Bounding Quantifier, 14th Annual Conference of the EACSL on Computer Science Logic, 2004.
DOI : 10.1007/978-3-540-30124-0_7

J. Chomicki, D. Goldin, G. Kuper, and D. Toman, Variable independence in constraint databases, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.6, pp.1422-1436, 2003.
DOI : 10.1109/TKDE.2003.1245282

S. Cosmadakis, G. Kuper, and L. Libkin, On the orthographic dimension of definable sets, Information Processing Letters, vol.79, issue.3, pp.141-145, 2001.
DOI : 10.1016/S0020-0190(00)00184-8

B. Courcelle, Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement, Information and Computation, vol.116, issue.2, pp.275-293, 1995.
DOI : 10.1006/inco.1995.1020

B. Courcelle, Linear delay enumeration and monadic second-order logic, Discrete Applied Mathematics, vol.157, issue.12, 2007.
DOI : 10.1016/j.dam.2008.08.021
URL : https://hal.archives-ouvertes.fr/hal-00333846

B. Courcelle and S. Oum, Vertex-minors, monadic second-order logic, and a conjecture by Seese, Journal of Combinatorial Theory, Series B, vol.97, issue.1, pp.91-126, 2007.
DOI : 10.1016/j.jctb.2006.04.003
URL : https://hal.archives-ouvertes.fr/hal-00334147

B. Courcelle, The monadic second-order logic of graphs X: Linear orderings, Theoretical Computer Science, vol.160, issue.1-2, pp.87-143, 1996.
DOI : 10.1016/0304-3975(95)00083-6

E. Filiot, J. Niehren, J. Talbot, and S. Tison, Polynomial time fragments of XPath with variables, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, 2007.
DOI : 10.1145/1265530.1265559
URL : https://hal.archives-ouvertes.fr/inria-00135678

S. Grumbach, P. Rigaux, and L. Segoufin, On the Orthographic Dimension of Constraint Databases, 7th International Conference on Database Theory, pp.199-216, 1999.
DOI : 10.1007/3-540-49257-7_14
URL : https://hal.archives-ouvertes.fr/hal-01124460

L. Libkin, Variable independence for first-order definable constraints, ACM Transactions on Computational Logic, vol.4, issue.4, pp.431-451, 2003.
DOI : 10.1145/937555.937557

L. Libkin, Logics over unranked trees: an overview, Logical Methods in Computer Science, vol.3, issue.2, pp.1-31, 2006.

H. Meuss, K. U. Schulz, and F. Bry, Towards Aggregated Answers for Semistructured Data, ICDT '01: Proceedings of the 8th International Conference on Database Theory, pp.346-360, 2001.
DOI : 10.1007/3-540-44503-X_22

J. Niehren, L. Planque, J. Talbot, and S. Tison, N-Ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, pp.217-231, 2005.
DOI : 10.1007/11601524_14
URL : https://hal.archives-ouvertes.fr/inria-00536522

T. Schwentick, On diving in trees, 25th International Symposium on Mathematical Foundations of Computer Science, pp.660-669, 2000.

H. Seidl, Ambiguity, valuedness and costs, 1992.

H. Seidl, Equivalence of finite-valued tree transducers is decidable, Mathematical Systems Theory, vol.4, issue.4, pp.285-346, 1994.
DOI : 10.1007/BF01192143

J. W. Thatcher and J. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol.12, issue.1, pp.57-82, 1968.
DOI : 10.1007/BF01691346