[. Borchardt, The Myhill-Nerode Theorem for Recognizable Tree Series, Developments in Language Theory, pp.146-158
DOI : 10.1007/3-540-45007-6_11

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

C. Rafael, J. Carrasco, J. Oncina, Y. Denis, A. Esposito et al., Stochastic inference of regular tree languages Learning rational stochastic languages Learning theory, Lecture Notes in Computer Science [DH07] François Denis and Amaury Habrard. Learning rational stochastic tree languages Formal tree series, Algorithmic Learning Theory, 18th International ConferenceMS99] C. Manning and H. Schütze. Foundations of Statistical Natural Language ProcessingWet80] C. S. Wetherell. Probabilistic languages: A review and some open questions, pp.185-197, 1980.