MAT learners for tree series: an abstract data type and two realizations
2011 (English)In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 48, no 3, 165-189 p.Article in journal (Refereed) Published
We propose abstract observation tables, an abstract data type for learning deterministic weighted tree automata in Angluin’s minimal adequate teacher (MAT) model, and show that every correct implementation of abstract observation tables yields a correct MAT learner. Besides the “classical” observation table, we show that abstract observation tables can also be implemented by observation trees. The advantage of the latter is that they often require fewer queries to the teacher.
Place, publisher, year, edition, pages
Springer , 2011. Vol. 48, no 3, 165-189 p.
automata; equivalence; queries
Research subject Computer Science; datorlingvistik
IdentifiersURN: urn:nbn:se:umu:diva-40568DOI: 10.1007/s00236-011-0135-xOAI: oai:DiVA.org:umu-40568DiVA: diva2:400910