On the learnability of recursively enumerable languages from good examples
| Authored By: | Sanjay Jain, Steffen Lange and Jochen Nessel |
| Paper Title: | On the learnability of recursively enumerable languages from good examples |
| In: | Theoret. Comput. Sci. |
| Number 1 Vol. 261 | |
| Publication Date: | 2001 |
| Pages: | 3-29 |
BibTeX Record:
@Article{jln-lrelge-01,
author = "Sanjay Jain and Steffen Lange and Jochen Nessel",
title = "On the learnability of recursively enumerable languages from good examples",
journal = "Theoret. Comput. Sci.",
volume = "261",
number = "1",
year = "2001",
pages = "3--29",
note = "Special issue for ALT '97",
}
Hide BibTeX Record
@Article{jln-lrelge-01,
author = "Sanjay Jain and Steffen Lange and Jochen Nessel",
title = "On the learnability of recursively enumerable languages from good examples",
journal = "Theoret. Comput. Sci.",
volume = "261",
number = "1",
year = "2001",
pages = "3--29",
note = "Special issue for ALT '97",
}