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]
No references recorded for this publication.
No citations of this publication recorded.