relation: http://acta.bibl.u-szeged.hu/12865/
title: MAT learners for recognizable tree languages and tree series
creator:  Drewes Frank
subject: 01. Természettudományok
subject: 01.02. Számítás- és információtudomány
description: 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.
date: 2009
type: Cikk, tanulmány, mű
type: NonPeerReviewed
format: part
language: hu
identifier: http://acta.bibl.u-szeged.hu/12865/1/Drewes_2009_ActaCybernetica.pdf
identifier:    Drewes Frank:   MAT learners for recognizable tree languages and tree series.  In: Acta cybernetica, (19) 2.  pp. 249-274. (2009)   
language: eng