T. Akutsu, A relation between edit distance for ordered trees and edit distance for Euler strings, Information Processing Letters, vol.100, issue.3, pp.105-109, 2006.
DOI : 10.1016/j.ipl.2006.06.002

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, p.16, 2009.
DOI : 10.1007/11779148_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.9971

C. Baier and J. P. Katoen, Principles of model checking, 2008.

M. Benedikt, G. Puppis, and C. Riveros, The Cost of Traveling between Languages, Automata , Languages and Programming (ICALP), pp.234-245, 2011.
DOI : 10.1016/0304-3975(95)00188-3
URL : https://hal.archives-ouvertes.fr/hal-00717760

M. Benedikt, G. Puppis, and C. Riveros, Regular Repair of Specifications, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.335-344, 2011.
DOI : 10.1109/LICS.2011.43
URL : https://hal.archives-ouvertes.fr/hal-00717758

M. Benedikt, G. Puppis, and C. Riveros, Bounded repairability of word languages, Journal of Computer and System Sciences, vol.79, issue.8, pp.1302-1321, 2013.
DOI : 10.1016/j.jcss.2013.06.001
URL : https://hal.archives-ouvertes.fr/hal-01076529

P. Bille, A survey on tree edit distance and related problems, Theoretical Computer Science, vol.337, issue.1-3, pp.217-239, 2005.
DOI : 10.1016/j.tcs.2004.12.030

P. V. Boas, The convenience of tilings, Complexity, Logic, and Recursion Theory, pp.331-363, 1997.

A. Brüggemann-klein and D. Wood, One-Unambiguous Regular Languages, Information and Computation, vol.142, issue.2, pp.182-206, 1998.
DOI : 10.1006/inco.1997.2695

J. Cristau, C. Löding, and W. Thomas, Deterministic Automata on Unranked Trees, Fundamentals of Computation Theory, pp.68-79, 2005.
DOI : 10.1007/11537311_7

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

E. Grädel, W. Thomas, and T. Wilke, Automata, logics, and infinite games: a guide to current research, 2003.
DOI : 10.1007/3-540-36387-4

V. Kumar, P. Madhusudan, and M. 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

W. Martens, F. Neven, and T. Schwentick, Deterministic top-down tree automata: past, present, and future. In: Logic and Automata: History and Perspectives, Logic and Games, pp.505-530, 2008.

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

M. Murata, D. Lee, M. Mani, and K. Kawaguchi, Taxonomy of XML schema languages using formal language theory, ACM Transactions on Internet Technology, vol.5, issue.4, pp.660-704, 2005.
DOI : 10.1145/1111627.1111631

G. Puppis, C. Riveros, and S. Staworko, Bounded repairability for regular tree languages, Proceedings of the 15th International Conference on Database Theory, ICDT '12, pp.155-168, 2012.
DOI : 10.1145/2274576.2274593
URL : https://hal.archives-ouvertes.fr/hal-00643100

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

K. C. Tai, The Tree-to-Tree Correction Problem, Journal of the ACM, vol.26, issue.3, pp.422-433, 1979.
DOI : 10.1145/322139.322143

R. Wagner and M. Fischer, The String-to-String Correction Problem, Journal of the ACM, vol.21, issue.1, pp.168-173, 1974.
DOI : 10.1145/321796.321811