Drewes Frank: MAT learners for recognizable tree languages and tree series. In: Acta cybernetica, (19) 2. pp. 249-274. (2009)
Preview |
Cikk, tanulmány, mű
Drewes_2009_ActaCybernetica.pdf Download (252kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2009 |
| Volume: | 19 |
| Number: | 2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 249-274 |
| Language: | English |
| Place of Publication: | Szeged |
| Event Title: | Weighted Automata : Theory and Applications (2008) (Dresden) |
| Related URLs: | http://acta.bibl.u-szeged.hu/38528/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 271-274. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 17. 08:39 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12865 |
Actions (login required)
 |
View Item |
