6533b821fe1ef96bd127ac01

RESEARCH PRODUCT

Co-learning of recursive languages from positive data

Rusins FreivaldsThomas Zeugmann

subject

Recursive data typeRecursive languageComputer scienceProgramming languageRecursive functionsAbstract family of languagesPositive dataInductive reasoningSpace (commercial competition)computer.software_genreLanguage acquisitioncomputer

description

The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive data. This refers to the following scenario. A family L of target languages as well as hypothesis space for it are specified. The co-learner is fed eventually all positive examples of an unknown target language L chosen from L. The target language L is successfully co-learned iff the co-learner can definitely delete all but one possible hypotheses, and the remaining one has to correctly describe L.

yearjournalcountryeditionlanguage
1996-01-01
https://doi.org/10.1007/3-540-62064-8_12