Arrow Research search
Back to TCS

TCS 2008

Learning and extending sublanguages

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

A number of natural models for learning in the limit are introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a part of the target language is available. Examples of language families are exhibited that are learnable in one model and not learnable in another one. Some characterizations for learnability of algorithmically enumerable families of languages for the models in question are obtained. Since learnability of any part of the target language does not imply monotonicity of the learning process, we consider our models also under the additional monotonicity constraint.

Authors

Keywords

  • Inductive inference
  • Learning sublanguages

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
748002171002908599