P. Buneman, M. Grohe, and C. Koch, Path Queries on Compressed XML, Proc. of the 29th Conf. on VLDB, pp.141-152, 2003.
DOI : 10.1016/B978-012722442-8/50021-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.9947

G. Busatto, M. Lohrey, and S. Maneth, Grammar-Based Tree Compression, 2004.

G. Busatto, M. Lohrey, and S. Maneth, Efficient Memory Representation of XML Documents, Proc. DBPL'05, pp.199-216, 2005.
DOI : 10.1007/11601524_13

B. Fila and S. Anantharaman, Automata for Analyzing and Querying Compressed Documents, Research Report, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00088776

M. Frick, M. Grohe, and C. Koch, Query evaluation on compressed trees, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.188-197, 2003.
DOI : 10.1109/LICS.2003.1210058

G. Gottlob and C. Koch, Monadic queries over tree-structured data, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.189-202, 2002.
DOI : 10.1109/LICS.2002.1029828
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.989

G. Gottlob, C. Koch, R. Pichler, and L. Segoufin, The complexity of XPath query evaluation and XML typing, Journal of the ACM, vol.52, issue.2, pp.284-335, 2005.
DOI : 10.1145/1059513.1059520

M. Lohrey, Word Problems and Membership Problems on Compressed Words, SIAM Journal on Computing, vol.35, issue.5, pp.1210-1240, 2006.
DOI : 10.1137/S0097539704445950
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6712

M. Marx, XPath and Modal Logics for Finite DAGs, Proc. of TABLEAUX'03, pp.150-164, 2003.
DOI : 10.1007/978-3-540-45206-5_13

W. Martens and F. Neven, On the complexity of typechecking top-down XML transformations, Theoretical Computer Sc, pp.153-180, 2005.
DOI : 10.1016/j.tcs.2004.10.035

F. Neven, Automata theory for XML researchers, ACM SIGMOD Record, vol.31, issue.3, 2002.
DOI : 10.1145/601858.601869

F. Neven and T. Schwentick, Query automata over finite trees, Theoretical Computer Science, pp.633-674, 2002.
DOI : 10.1016/S0304-3975(01)00301-2
URL : http://doi.org/10.1016/s0304-3975(01)00301-2

W. Rytter, Compressed and fully compressed pattern matching in one and two dimensions, Proceedings of the IEEE, pp.1769-1778, 2000.
DOI : 10.1109/5.892712

. Std, axis::?[Xcan] conn axis'::? ? [X ? can