L. Segoufin and V. Vianu, Validating streaming XML documents, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.53-64, 2002.
DOI : 10.1145/543613.543622
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.6403

W. Martens, F. Neven, T. Schwentick, and G. J. Bex, Expressiveness and complexity of XML Schema, ACM Transactions on Database Systems, vol.31, issue.3, pp.770-813, 2006.
DOI : 10.1145/1166074.1166076

A. K. Gupta and D. Suciu, Stream processing of XPath queries with predicates, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.419-430, 2003.
DOI : 10.1145/872757.872809

M. Benedikt and A. Jeffrey, Efficient and Expressive Tree Filters, Foundations of Software Technology and Theoretical Computer Science, pp.461-472, 2007.
DOI : 10.1007/978-3-540-77050-3_38

Z. Bar-yossef, M. Fontoura, and V. Josifovski, Buffering in query evaluation over XML streams, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.216-227, 2005.
DOI : 10.1145/1065167.1065195

D. Olteanu, SPEX: Streamed and Progressive Evaluation of XPath, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.7, pp.934-949, 2007.
DOI : 10.1109/TKDE.2007.1063

G. Gou and R. Chirkova, Efficient algorithms for evaluating xpath over streams, Proceedings of the 2007 ACM SIGMOD international conference on Management of data , SIGMOD '07, pp.269-280, 2007.
DOI : 10.1145/1247480.1247512

A. Berlea, Online evaluation of regular tree queries, Nordic Journal of Computing, vol.13, issue.4, pp.1-26, 2006.

O. Gauwin, J. Niehren, and S. Tison, Earliest query answering for deterministic streaming tree automata and a fragment of XPath, 2009.

O. Gauwin, J. Niehren, and Y. Roos, Streaming tree automata, Information Processing Letters, vol.109, issue.1, pp.13-17, 2008.
DOI : 10.1016/j.ipl.2008.08.002
URL : https://hal.archives-ouvertes.fr/inria-00288445

R. Alur, Marrying words and trees, In: ACM PODS, pp.233-242, 2007.
DOI : 10.1007/978-3-540-74510-5_3
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1549&context=cis_papers

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

A. Neumann and H. Seidl, Locating Matches of Tree Patterns in Forests, Foundations of Software Technology and Theoretical Computer Science, pp.134-145, 1998.
DOI : 10.1007/978-3-540-49382-2_12

H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard et al., Available online since, 1997.

J. Carme, J. Niehren, and M. Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th International Conference on Rewriting Techniques and Applications, pp.105-118, 2004.
DOI : 10.1007/978-3-540-25979-4_8
URL : https://hal.archives-ouvertes.fr/inria-00536529

H. Seidl, Single-valuedness of tree transducers is decidable in polynomial time, Theoretical Computer Science, vol.106, issue.1, pp.135-181, 1992.
DOI : 10.1016/0304-3975(92)90281-J

R. E. Stearns, I. Hunt, and H. B. , On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata, SIAM Journal on Computing, vol.14, issue.3, pp.598-611, 1985.
DOI : 10.1137/0214044

A. Weber and H. Seidl, On the degree of ambiguity of finite automata, In: Mathematical Foundations of Computer Science. LNCS, vol.233, pp.620-629, 1986.

C. Allauzen, M. Mohri, and A. Rastogi, General Algorithms for Testing the Ambiguity of Finite Automata, In: DLT. LNCS, vol.5257, pp.108-120, 2008.
DOI : 10.1007/978-3-540-85780-8_8

J. Carme, A. Lemay, and J. Niehren, Learning Node Selecting Tree Transducer from Completely Annotated Examples, 7th International Colloquium on Grammatical Inference, pp.91-102, 2004.
DOI : 10.1007/978-3-540-30195-0_9
URL : https://hal.archives-ouvertes.fr/inria-00536528

H. Seidl, Ambiguity, valuedness and costs (1992) Habilitation Thesis

J. Sakarovitch and R. De-souza, On the Decidability of Bounded Valuedness for Transducers, In: Mathematical Foundations of Computer Science, 2008.
DOI : 10.1007/978-3-540-85238-4_48