R. Carrasco, J. Oncina, and J. Calera-rubio, Stochastic inference of regular tree languages, Machine Learning, vol.44, issue.12, pp.185-197, 2001.
DOI : 10.1007/BFb0054075

F. Denis and Y. Esposito, On rational stochastic languages, Fundamenta Informaticae, vol.86, pp.41-77, 2008.

F. Denis and A. Habrard, Learning Rational Stochastic Tree Languages, Proc. of 18th conf. on Algorithmic Learning Theory, pp.242-256, 2007.
DOI : 10.1007/978-3-540-27819-1_9
URL : https://hal.archives-ouvertes.fr/hal-00192401

F. Denis, E. Gilbert, A. Habrard, F. Ouardi, and M. Tommasi, Relevant Representations for the Inference of Rational Stochastic Tree Languages, Grammatical Inference: Algorithms and Applications, 9th International Colloquium, pp.57-70, 2008.
DOI : 10.1007/978-3-540-88009-7_5
URL : https://hal.archives-ouvertes.fr/hal-00293511

R. Bailly, F. Denis, and L. Ralaivola, Grammatical inference as a principal component analysis problem, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.33-40, 2009.
DOI : 10.1145/1553374.1553379

A. Clark, C. Florêncio, C. Watkins, and C. , Languages as hyperplanes: grammatical inference with string kernels, Proceedings of the European Conference on Machine Learning (ECML), pp.90-101, 2006.

D. Hsu, S. Kakade, and T. Zhang, A spectral algorithm for learning Hidden Markov Models, Proceedings of COLT'2009, 2009.
DOI : 10.1016/j.jcss.2011.12.025

D. Hsu, S. Kakade, and T. Zhang, A spectral algorithm for learning Hidden Markov Models, Journal of Computer and System Sciences, vol.78, issue.5, 2009.
DOI : 10.1016/j.jcss.2011.12.025

F. Denis and Y. Esposito, Learning Classes of Probabilistic Automata, Proc. 17h Conference on Learning theory, pp.124-139, 2004.
DOI : 10.1007/978-3-540-27819-1_9

J. Berstel and C. Reutenauer, Recognizable formal power series on trees, Theoretical Computer Science, vol.18, issue.2, pp.115-148, 1982.
DOI : 10.1016/0304-3975(82)90019-6
URL : https://hal.archives-ouvertes.fr/hal-00619497

J. Högberg, A. Maletti, and H. Vogler, Bisimulation minimisation of weighted automata on unranked trees, Fundam. Inform, vol.92, issue.12, pp.103-130, 2009.

B. Borchardt, The Theory of Recognizable Tree Series, 2004.

C. Mcdiarmid, On the method of bounded differences, pp.148-188, 1989.
DOI : 10.1017/CBO9781107359949.008

G. Stewart and J. G. Sun, Matrix Perturbation Theory, 1990.

L. Zwald and G. Blanchard, On the convergence of eigenspaces in kernel principal component analysis, Proceedings of NIPS'05, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00373803

J. Shawe-taylor, N. Cristianini, and J. Kandola, On the concentration of spectral properties, Proc. of NIPS, pp.511-517, 2001.

A. Smola, A. Gretton, L. Song, and B. Schölkopf, A Hilbert Space Embedding for Distributions, 18th International Conference on Algorithmic Learning Theory, pp.13-31, 2007.
DOI : 10.1073/pnas.0601231103

L. Song, B. Boots, S. Saddiqi, G. Gordon, and A. Smola, Hilbert space embeddings of Hidden Markov Models, Proceedings of ICML 2010