On the learnability of recursively enumerable languages from good examples

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]

Authors

Sanjay Jain

This author has not been identified. Look up 'Sanjay Jain' in Google

Steffen Lange

This author has not been identified. Look up 'Steffen Lange' in Google

Jochen Nessel

This author has not been identified. Look up 'Jochen Nessel' in Google