Abstract
We consider the problem of language identification in the limit from positive data enumerated by functions restricted to the class of primitive recursive functions. Conditions are described under which a family of languages is identifiable. They depend on the behavior of inference machines when they are presented with enumeration of elements of unknown languages. How these conditions compare to cases when positive data are enumerated by recursive functions is also considered.
