%N 2
%K SzĂĄmĂ­tĂĄstechnika, Kibernetika
%C Szeged
%V 19
%L acta12865
%P 249-274
%A  Drewes Frank
%T MAT learners for recognizable tree languages and tree series
%D 2009
%O Bibliogr.: p. 271-274. ; ĂśsszefoglalĂĄs angol nyelven
%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.
%J Acta cybernetica