LEARNING RECURSIVE LANGUAGES FROM GOOD EXAMPLES

Authors
LANGE S NESSEL J WIEHAGEN R
Citation
S. Lange et al., LEARNING RECURSIVE LANGUAGES FROM GOOD EXAMPLES, Annals of mathematics and artificial intelligence, 23(1-2), 1998, pp. 27-52
Citations number
17
Categorie Soggetti
Mathematics,"Computer Science Artificial Intelligence",Mathematics,"Computer Science Artificial Intelligence
Journal title
Annals of mathematics and artificial intelligence → ACNP
ISSN journal
10122443
Volume
23
Issue
1-2
Year of publication
1998
Pages
27 - 52
Database
ISI
SICI code
1012-2443(1998)23:1-2<27:LRLFGE>2.0.ZU;2-J
Abstract
We study learning of indexable families of recursive languages from go od examples. We show that this approach can be considerably more power ful than learning from all examples and point out reasons for this add itional power. We present several characterizations of types of learni ng from good examples. We derive similarities as well as differences t o learning of recursive functions from good examples.