Sanjay Jain, Steffen Lange, Jochen Nessel. On the learnability of recursively enumerable languages from good examples. Theoretical Computer Science, 261(1):3-29, 2001. [doi]
@article{JainLN01,
title = {On the learnability of recursively enumerable languages from good examples},
author = {Sanjay Jain and Steffen Lange and Jochen Nessel},
year = {2001},
doi = {10.1016/S0304-3975(00)00131-6},
url = {http://dx.doi.org/10.1016/S0304-3975(00)00131-6},
researchr = {https://researchr.org/publication/JainLN01},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {261},
number = {1},
pages = {3-29},
}