Co-learning of recursive languages from positive data

DOI10.1007/3-540-62064-8_12MaRDI QIDQ6570930zbMATH OpenFDO

Authors Rūsiņš Freivalds, Thomas Zeugmann

Publication date 11 July 2024

Mathematics Subject Classification ID

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

Recommendations

• Learnability of co-r.e. classes
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• On the learnability of recursively enumerable languages from good examples
• scientific article; zbMATH DE number 512873
• Algorithmic Learning Theory

Cites work

• scientific article; zbMATH DE number 67610 (Why is no real title available?)
• scientific article; zbMATH DE number 408780 (Why is no real title available?)
• scientific article; zbMATH DE number 2077152 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A learning-theoretic characterization of classes of recursive functions
• Characterizations of monotonic and dual monotonic language learning
• Finding patterns common to a set of strings
• Ignoring data may be the only way to learn efficiently
• Inductive inference of formal languages from positive data
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Language identification in the limit
• Polynomial-time inference of arbitrary pattern languages

This page was built for publication: Co-learning of recursive languages from positive data

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