18 search results - page 1 / 4 » Learning indexed families of recursive languages from positi... |
TCS
2008
14 years 6 months ago
2008
103
click to vote
GOSLER
1995
14 years 10 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
AMAI
1998
Springer
14 years 6 months ago
1998
Springer
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
ALT
1998
Springer
14 years 11 months ago
1998
Springer
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
ALT
1997
Springer
14 years 11 months ago
1997
Springer
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) generat...