Learning Deterministically Recognizable Tree Series

We devise a learning algorithm for deterministically recognizable tree series where the weights are taken from a commutative group. For this, we use an adaptation of the minimal adequate teacher model that was originally introduced by Angluin. The algorithm runs in polynomial time and constructs the unique minimal deterministic bottom-up finite state weighted tree automaton that recognizes the tree series in question. Copyright c © 2006 UMINF 06.27 ISSN 0348-0542