%0 Journal Article
%@ 0324-721X
%A  Drewes Frank
%C Szeged
%D 2009
%F acta:12865
%J Acta cybernetica
%K Számítástechnika, Kibernetika
%N 2
%P 249-274
%T MAT learners for recognizable tree languages and tree series
%U http://acta.bibl.u-szeged.hu/12865/
%V 19
%X We review a family of closely related query learning algorithms for unweighted and weighted tree automata, all of which are based on adaptations of the minimal adequate teacher (MAT) model by Angluin. Rather than presenting  new results, the goal is to discuss these algorithms in sufficient detail to make their similarities and differences transparent to the reader interested in grammatical inference of tree automata.
%Z Bibliogr.: p. 271-274. ; összefoglalás angol nyelven