@article{ITA_2015__49_2_121_0,
     author = {Finkel, Olivier and Lecomte, Dominique and Simonnet, Pierre},
     title = {An upper bound on the complexity of recognizable tree languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {121--137},
     publisher = {EDP-Sciences},
     volume = {49},
     number = {2},
     year = {2015},
     doi = {10.1051/ita/2015002},
     mrnumber = {3373811},
     zbl = {1373.03066},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ita/2015002/}
}