V. Benzaken, G. Castagna, K. Nguyen, and &. Siméon, Static and dynamic semantics of NoSQL languages, pp.101-114, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00797956

K. S. Beyer, V. Ercegovac, R. Gemulla, A. Balmin, M. Y. Eltabakh et al., Jaql: A Scripting Language for Large Scale Semistructured Data Analysis, PVLDB, vol.4, issue.12, pp.1272-1283, 2011.

I. Boneva and &. Talbot, Automata and Logics for Unranked and Unordered Trees, 20th International Conference on Rewriting Techniques and Applications, pp.500-515, 2005.
DOI : 10.1007/978-3-540-32033-3_36
URL : https://hal.archives-ouvertes.fr/inria-00536694

P. Gawrychowski, Chrobak Normal Form Revisited, with Applications, pp.142-153, 2011.
DOI : 10.1016/j.ipl.2009.06.005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.6730

E. John, R. Hopcroft, &. Motwani, D. Jeffrey, and . Ullman, Introduction to automata theory, languages, and computation, ACM SIGACT News, vol.32, issue.1, pp.60-65, 2001.

E. Kopczynski, Complexity of Problems of Commutative Grammars, Logical Methods in Computer Science, vol.11, issue.1, p.0, 2014.
DOI : 10.2168/LMCS-11(1:9)2015

E. Kopczynski, &. Anthony-widjaja, and . To, Parikh Images of Grammars: Complexity and Applications, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.80-89, 2010.
DOI : 10.1109/LICS.2010.21

M. Müller, J. Niehren, and R. Treinen, The First-Order Theory of Ordering Constraints over Feature Trees, 13th annual IEEE Symposium on Logic in Computer Sience, pp.432-44310, 1998.

J. Niehren and &. Podelski, Feature automata and recognizable sets of feature trees, TAPSOFT: Theory and Practice of Software Development: Joint International Conference CAAP, pp.356-37510, 1993.
DOI : 10.1007/3-540-56610-4_76
URL : https://hal.archives-ouvertes.fr/inria-00536823

N. Nurseitov, M. Paulson, R. , and C. Izurieta, Comparison of JSON and XML Data Interchange Formats: A Case Study, pp.157-162, 2009.

H. Seidl, T. Schwentick, and &. , Numerical document queries, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.155-16610, 2003.
DOI : 10.1145/773153.773169

H. Seidl, T. Schwentick, and &. , Counting in trees, Logic and Automata, Texts in Logic and Games 2, pp.575-612, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00358327

H. Seidl and T. Schwentick, Counting in Trees for Free, Anca Muscholl & Peter Habermehl Lecture Notes in Computer Science, vol.3142, pp.1136-1149, 2004.
DOI : 10.1007/978-3-540-27836-8_94
URL : https://hal.archives-ouvertes.fr/hal-00159525

G. Smolka, Feature-constraint logics for unification grammars, The Journal of Logic Programming, vol.12, issue.1-2, pp.51-8710, 1992.
DOI : 10.1016/0743-1066(92)90039-6

G. Smolka and &. Treinen, Records for logic programming, The Journal of Logic Programming, vol.18, issue.3, pp.229-25810, 1994.
DOI : 10.1016/0743-1066(94)90044-2

J. W. Thatcher and &. J. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical System Theory 2, pp.57-82, 1968.
DOI : 10.1007/BF01691346

S. Dal-zilio and &. D. Lugiez, XML Schema, Tree Logic and Sheaves Automata, Proc. of RTA -Rewriting Techniques and Applications, pp.246-26310, 2003.
DOI : 10.1007/3-540-44881-0_18
URL : https://hal.archives-ouvertes.fr/hal-00109288