R. Alur, Marrying words and trees, 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.233-242, 2007.

R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan, Congruences for visibly pushdown languages, Automata, Languages and Programming, 32nd International Colloquium, vol.3580, pp.1102-1114, 2005.

R. Alur and P. Madhusudan, 36th ACM Symposium on Theory of Computing, pp.202-211, 2004.

M. Benedikt, A. Jeffrey, and R. Ley-wild, Stream Firewalling of XML Constraints, ACM SIGMOD International Conference on Management of Data, pp.487-498, 2008.

L. Bozzelli and C. Sánchez, Visibly rational expressions, Acta Inf, vol.51, issue.1, pp.25-49, 2014.

A. Brüggemann-klein, Regular expressions into finite automata, Theoretical Computer Science, vol.120, issue.2, pp.90287-90291, 1993.

A. Brüggemann-klein and D. Wood, One-Unambiguous regular languages. Information and Computation, vol.142, pp.182-206, 1998.

J. Carme, J. Niehren, and M. Tommasi, Querying unranked trees with stepwise tree automata, 19th International Conference on Rewriting Techniques and Applications, vol.3091, pp.105-118, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00536529

J. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Efficient inclusion checking for deterministic tree automata and XML schemas, Information and Computation, vol.207, issue.11, pp.1181-1208, 2009.

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

L. D'antoni and R. Alur, Held as Part of the Vienna Summer of Logic, Computer Aided Verification -26th International Conference, vol.8559, pp.209-225, 2014.

D. Debarbieux, O. Gauwin, J. Niehren, T. Sebastian, and M. Zergaoui, Early nested word automata for xpath query answering on XML streams, Theor. Comput. Sci, vol.578, pp.100-125, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00676178

M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, J. Comput. Syst. Sci, vol.18, issue.2, pp.90046-90047, 1979.

M. Franceschet, Xpathmark performance test, pp.2020-2023

O. Gauwin, J. Niehren, B. B. Markhoff, P. Caron, and J. M. Champarnaud, Streamable fragments of forward XPath, International Conference on Implementation and Application of Automata, vol.6807, pp.3-15, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00442250

O. Gauwin, J. Niehren, and S. Tison, Earliest query answering for deterministic nested word automata, 17th International Symposium on Fundamentals of Computer Theory, vol.5699, pp.121-132
URL : https://hal.archives-ouvertes.fr/inria-00390236

G. Gottlob, C. Koch, and R. Pichler, The complexity of XPath query evaluation, 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.179-190, 2003.
URL : https://hal.archives-ouvertes.fr/hal-02886548

A. Grez, C. Riveros, and M. Ugarte, A formal framework for complex event processing, 22nd International Conference on Database Theory, ICDT 2019, vol.127, pp.1-5, 2019.

H. Hosoya and B. C. Pierce, Xduce: A statically typed XML processing language, ACM Trans. Internet Techn, vol.3, issue.2, pp.117-148, 2003.

,

W. Martens and J. Niehren, On the Minimization of XML-Schemas and Tree Automata for Unranked Trees, Journal of Computer and System Science, vol.73, issue.4, pp.550-583, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00088406

B. Mozafari, K. Zeng, and C. Zaniolo, From regular expressions to nested words: Unifying languages and query execution for relational and XML sequences, PVLDB, vol.3, issue.1, pp.150-161, 2010.

B. Mozafari, K. Zeng, C. Zaniolo, K. S. Candan, Y. Chen et al., High-performance complex event processing over XML streams, SIGMOD Conference, pp.253-264, 2012.

A. Neumann and H. Seidl, Locating matches of tree patterns in forests, Foundations of Software Technology and Theoretical Computer Science, vol.1530, pp.134-145, 1998.

D. Olteanu, SPEX: Streamed and progressive evaluation of XPath, IEEE Trans. on Know. Data Eng, vol.19, issue.7, pp.934-949, 2007.

,

C. Pitcher, Visibly pushdown expression effects for xml stream processing, 2005.

J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of automata theory, Journal of Computer and System Science, vol.1, pp.317-322, 1967.

, A3: /site/closed auctions/closed auction//keyword A4: /site/closed auctions/closed auction [annotation/description/text/keyword]/date A5: /site/closed auctions/closed auction