scientific article; zbMATH DE number 512873

zbMATH Open0797.68134MaRDI QIDQ4281570FDOQ4281570

S. Lange, Thomas Zeugmann

Publication date: 19 October 1994

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

zbMATH Keywords

learning algorithmsalgorithmic learning theoryovergeneralizationbounded mind changeslearnability of enumerable families of uniformly recursive languages

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Cited In (10)

• Induction by enumeration
• Probabilistic and pluralistic learners with mind changes
• Prudence and other conditions on formal language learning
• On some open problems in monotonic and conservative learning
• Prescribed learning of r.e. classes
• Mind change efficient learning
• Repeating and remembering foreign language words: Implications for language teaching systems
• Mind change speed-up for learning languages from positive data
• 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 Q4281570)