MAT learners for recognizable tree languages and tree series
AbstractWe 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.
Download data is not yet available.
How to Cite
Drewes, F. (2009). MAT learners for recognizable tree languages and tree series. Acta Cybernetica, 19(2), 249-274. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3768