scientific article; zbMATH DE number 2077176

zbMATH Open1044.68659MaRDI QIDQ4470569FDOQ4470569

Authors: Rolf Wiehagen, S. Lange, J. Nessel 

Publication date: 1 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• Learning recursive languages from good examples
• scientific article; zbMATH DE number 1104342
• On the learnability of recursively enumerable languages from good examples
• A general comparison of language learning from examples and from queries
• scientific article

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cited In (9)

• The complexity of universal text-learners.
• Title not available (Why is that?)
• Developments from enquiries into the learnability of the pattern languages from positive data
• Constructing simply recursive programs from a finite set of good examples
• A general comparison of language learning from examples and from queries
• Title not available (Why is that?)
• Grammar induction by unification of type-logical lexicons
• Language learning without overgeneralization
• Language learning without overgeneralization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470569)