| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 2, 2009>>> |
 Magyarul
|
MAT Learners for Recognizable Tree Languages and Tree Series
Abstract (in LaTeX format)
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.
Kewords: algorithmic learning, grammatical inference, tree automaton, tree language, tree series.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Drewes:2009:ActaCybernetica,author = {Frank Drewes},
title = {MAT Learners for Recognizable Tree Languages and Tree Series},
journal = {Acta Cybernetica},
volume = {19},
number= {2},
pages = {249--274},
year = {2009},
abstract = {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.},
keywords = {algorithmic learning, grammatical inference, tree automaton, tree language, tree series}
}