MAT learners for recognizable tree languages and tree series

Drewes, Frank: MAT learners for recognizable tree languages and tree series. Acta cybernetica, (19) 2. pp. 249-274. (2009)

[img] Cikk, tanulmány, mű

Download (252kB)


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.

Item Type: Article
Event Title: Weighted Automata: Theory and Applications, 2008, Dresden
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 2
Page Range: pp. 249-274
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 271-274.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 06. 10:13

Actions (login required)

View Item View Item