1. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoret. Comput. Sci. 18(2), 115–148 (1982)
2. Berstel, J., Reutenauer, C.: Rational Series and Their Languages, EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)
3. Borchardt, B.: The theory of recognizable tree series. Ph.D. thesis, Technische Universität Dresden (2005)
4. Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoret. Comput. Sci. 27(1–2), 211–215 (1983)
5. Chattopadhyay, A., Mazowiecki, F., Muscholl, A., Riveros, C.: Pumping lemmas for weighted automata. arXiv:2001.06272 arXiv (2020)