| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332904 | Journal of Computer and System Sciences | 2013 | 18 Pages |
Abstract
⺠We study limit learners that output descriptive patterns instead of exact grammars. ⺠Inferrability of indexed families depends on concepts related to Angluinʼs telltales. ⺠Our model is shown to be an instance of a natural extension of Gold-style learning. ⺠Terminal-free E-descriptive patterns can be inferred for rich classes of languages. ⺠Our proofs make use of novel insights into combinatorial properties of such patterns.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dominik D. Freydenberger, Daniel Reidenbach,