%0 Journal Article
%A Finkel, Olivier
%A Lecomte, Dominique
%A Simonnet, Pierre
%T An upper bound on the complexity of recognizable tree languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2015
%P 121-137
%V 49
%N 2
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ita/2015002/
%R 10.1051/ita/2015002
%G en
%F ITA_2015__49_2_121_0