MAT learners for recognizable tree languages and tree series
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...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2009
|
| Sorozat: | Acta cybernetica
19 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12865 |
| LEADER | 01238nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12865 | ||
| 005 | 20220617083922.0 | ||
| 008 | 161015s2009 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Drewes Frank | |
| 245 | 1 | 0 | |a MAT learners for recognizable tree languages and tree series |h [elektronikus dokumentum] / |c Drewes Frank |
| 260 | |c 2009 | ||
| 300 | |a 249-274 | ||
| 490 | 0 | |a Acta cybernetica |v 19 No. 2 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 710 | |a Weighted Automata : Theory and Applications (2008) (Dresden) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12865/1/Drewes_2009_ActaCybernetica.pdf |z Dokumentum-elérés |