Please use this identifier to cite or link to this item:
|Title:||Learning and extending sublanguages|
|Authors:||Jain, S. |
|Citation:||Jain, S., Kinber, E. (2008). Learning and extending sublanguages. Theoretical Computer Science 397 (1-3) : 233-246. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tcs.2008.02.031|
|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. © 2008 Elsevier Ltd. All rights reserved.|
|Source Title:||Theoretical Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 5, 2018
checked on Sep 7, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.