On the learnability of recursively enumerable languages from good examples
10.1016/S0304-3975(00)00131-6
Saved in:
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 |
Similar Items
-
One-shot learners using negative counterexamples and nearest positive examples
by: Jain, S., et al.
Published: (2013) -
A general comparison of language learning from examples and from queries
by: Jain, S., et al.
Published: (2013) -
Learnability of automatic classes
by: Jain, S., et al.
Published: (2013) -
Enlarging learnable classes
by: Jain S., et al.
Published: (2020) -
Learning languages from positive data and negative counterexamples
by: Jain, S., et al.
Published: (2013)