The Myhill-Nerode Theorem for Recognizable Tree Series. - Björn Borchardt (Developments in Language Theory, 2003)

Determinization of Finite State Weighted Tree Automata. - Björn Borchardt; Heiko Vogler (J. Autom. Lang. Comb., 2003)

Code Selection by Tree Series Transducers. - Björn Borchardt (CIAA, 2004)

A Pumping Lemma and Decidability Problems for Recognizable Tree Series. - Björn Borchardt (Acta Cybern., 2004)

Bounds for Tree Automata with Polynomial Costs. - Björn Borchardt; Zoltán Fülöp 001; Zsolt Gazdag; Andreas Maletti (J. Autom. Lang. Comb., 2005)

Cut sets as recognizable tree languages. - Björn Borchardt; Andreas Maletti; Branimir Seselja; Andreja Tepavcevic; Heiko Vogler (Fuzzy Sets Syst., 2006)