L. D. Alur and . Antoni, Streaming tree transducers. CoRR, abs, 1104.
DOI : 10.1007/978-3-642-31585-5_8
URL : http://arxiv.org/abs/1104.2599

P. Alur and . Madhusudan, Adding nesting structure to words, JACM, vol.5616, issue.3, pp.1-1643, 2009.
DOI : 10.1007/11779148_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.9971

M. Bar-yossef, V. Fontoura, and . 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

C. Bárány, O. Löding, and . Serre, Regularity problems for visibly pushdown languages, STACS, pp.420-431, 2006.

L. Barbosa, P. Mignet, and . Veltri, Studying the XML Web: Gathering Statistics from an XML Sample, World Wide Web, vol.11, issue.4, pp.413-438, 2005.
DOI : 10.1007/s11280-005-1544-y

M. Bauer, C. Leucker, and . Schallhart, Runtime Verification for LTL and TLTL, ACM Transactions on Software Engineering and Methodology, vol.20, issue.4, 2011.
DOI : 10.1145/2000799.2000800

A. Benedikt and . Jeffrey, Efficient and Expressive Tree Filters, FSTTCS, pp.461-472, 2007.
DOI : 10.1007/978-3-540-77050-3_38

D. Boag, M. F. Chamberlin, D. Fernàndez, J. Florescu, J. Robie et al., XQuery 1.0: An XML query language, W3C recommendation, 2007.

P. Caralp, J. Reynier, and . Talbot, A polynomial procedure for trimming visibly pushdown automata, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00606778

. Choffrut, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles, Theoretical Computer Science, vol.5, issue.3, pp.325-337, 1977.
DOI : 10.1016/0304-3975(77)90049-4
URL : http://doi.org/10.1016/0304-3975(77)90049-4

J. Filiot, P. Raskin, F. Reynier, J. Servais, and . Talbot, Properties of Visibly Pushdown Transducers, MFCS, pp.355-367, 2010.
DOI : 10.1007/978-3-642-15155-2_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

J. Gauwin, S. Niehren, and . Tison, Earliest??Query??Answering for Deterministic Nested Word Automata, FCT, pp.121-132, 2009.
DOI : 10.1007/978-3-642-03409-1_12
URL : https://hal.archives-ouvertes.fr/inria-00390236

C. Grohe, N. Koch, and . Schweikardt, Tight lower bounds for query processing on streaming and external memory data, Theoretical Computer Science, vol.380, issue.1-2, pp.199-217, 2007.
DOI : 10.1016/j.tcs.2007.02.062

O. H. Harju, J. Ibarra, A. Karhumaki, and . Salomaa, Some Decision Problems Concerning Semilinearity and Commutation, Journal of Computer and System Sciences, vol.65, issue.2, p.65, 2002.
DOI : 10.1006/jcss.2002.1836

K. and F. Magniez, Validating XML documents in the streaming model with external memory, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00580814

P. Kumar, M. Madhusudan, and . Viswanathan, Visibly pushdown automata for streaming XML, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.1053-1062, 2007.
DOI : 10.1145/1242572.1242714

M. Y. Kupferman and . Vardi, Model Checking of Safety Properties, Formal Methods in System Design, vol.19, issue.3, pp.291-314, 2001.
DOI : 10.1007/3-540-48683-6_17

M. Madhusudan and . Viswanathan, Query Automata for Nested Words, MFCS, pp.561-573, 2009.
DOI : 10.1016/S0304-3975(01)00301-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.6045

. Theor, . Comput, C. Sci, E. Choffrut, J. Filiot et al., Une Caractérisation des Fonctions Séquentielles et des Fonctions Sous- Séquentielles en tant que Relations Rationnelles On functionality of visibly pushdown transducers. CoRR, abs/1002 Properties of visibly pushdown transducers On systems of word equations with simple loop sets, MFCS 28 M. Lothaire. Combinatorics on words, pp.225-251325, 1443.