1. Aminof, B., Kupferman, O., Lampert, R.: Rigorous approximated determinization of weighted automata. Theoret. Comput. Sci. 480, 104–117 (2013)
2. Béal, M.P., Carton, O.: Determinization of transducers over finite and infinite words. Theoret. Comput. Sci. 289(1), 225–251 (2002)
3. Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)
4. Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybernet. 16(4), 509–544 (2004)
5. Büchse, M., May, J., Vogler, H.: Determinization of weighted tree automata using factorizations. J. Autom. Lang. Comb. 15(3/4), 229–254 (2010)