An upper bound on the complexity of recognizable tree languagesOlivier Finkel, Dominique Lecomte and Pierre SimonnetRAIRO-Theor. Inf. Appl., 49 2 (2015) 121-137DOI: https://doi.org/10.1051/ita/2015002
