We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The learning is exact, supervised, and uses an adapted minimal adequate teacher; a learning model introduced by Angluin. Our algorithm learns a minimal deterministic wta that recognizes the taught tree series and runs in polynomial time in the size of that wta and the size of the provided counterexamples. Compared to the original algorithm, we show how to handle non-final states in the learning process; this problem was posed as an open problem in [Drewes, Vogler: Learning Deterministically Recognizable Tree Series, J. Autom. Lang. Combin. 2007]. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Maletti, A. (2007). Learning deterministically recognizable tree series - Revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4728 LNCS, pp. 218–235). Springer Verlag. https://doi.org/10.1007/978-3-540-75414-5_14
Mendeley helps you to discover research relevant for your work.