On the learnability of recursively enumerable languages from good examples

10.1016/S0304-3975(00)00131-6

Saved in:
Bibliographic Details
Main Authors: Jain, S., Lange, S., Nessel, J.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Subjects:
Online Access:http://scholarbank.nus.edu.sg/handle/10635/41043
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-41043
record_format dspace
spelling sg-nus-scholar.10635-410432023-10-30T22:22:15Z On the learnability of recursively enumerable languages from good examples Jain, S. Lange, S. Nessel, J. COMPUTER SCIENCE Computational learning theory Good examples Inductive inference 10.1016/S0304-3975(00)00131-6 Theoretical Computer Science 261 1 3-29 TCSCD 2013-07-04T08:18:18Z 2013-07-04T08:18:18Z 2001 Conference Paper Jain, S., Lange, S., Nessel, J. (2001). On the learnability of recursively enumerable languages from good examples. Theoretical Computer Science 261 (1) : 3-29. ScholarBank@NUS Repository. https://doi.org/10.1016/S0304-3975(00)00131-6 03043975 http://scholarbank.nus.edu.sg/handle/10635/41043 000169420100002 Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Computational learning theory
Good examples
Inductive inference
spellingShingle Computational learning theory
Good examples
Inductive inference
Jain, S.
Lange, S.
Nessel, J.
On the learnability of recursively enumerable languages from good examples
description 10.1016/S0304-3975(00)00131-6
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Jain, S.
Lange, S.
Nessel, J.
format Conference or Workshop Item
author Jain, S.
Lange, S.
Nessel, J.
author_sort Jain, S.
title On the learnability of recursively enumerable languages from good examples
title_short On the learnability of recursively enumerable languages from good examples
title_full On the learnability of recursively enumerable languages from good examples
title_fullStr On the learnability of recursively enumerable languages from good examples
title_full_unstemmed On the learnability of recursively enumerable languages from good examples
title_sort on the learnability of recursively enumerable languages from good examples
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/41043
_version_ 1781411105962196992