TY  - JOUR
AV  - public
A1  -  Drewes Frank
TI  - MAT learners for recognizable tree languages and tree series
SN  - 0324-721X
KW  - Számítástechnika
KW  -  Kibernetika
IS  - 2
UR  - http://acta.bibl.u-szeged.hu/12865/
N1  - Bibliogr.: p. 271-274. ; összefoglalás angol nyelven
ID  - acta12865
N2  - 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.
SP  - 249
Y1  - 2009///
EP  - 274
CY  - Szeged
JF  - Acta cybernetica
VL  - 19
ER  -