Co-learning of recursive languages from positive data

DOI10.1007/3-540-62064-8_12zbMATH Open1541.68165MaRDI QIDQ6570930FDOQ6570930

Authors: Rūsiņš Freivalds, Thomas Zeugmann 

Publication date: 11 July 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Inductive inference of formal languages from positive data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language identification in the limit
• Finding patterns common to a set of strings
• Title not available (Why is that?)
• Characterizations of monotonic and dual monotonic language learning
• Polynomial-time inference of arbitrary pattern languages
• Ignoring data may be the only way to learn efficiently
• Title not available (Why is that?)
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Title not available (Why is that?)
• A learning-theoretic characterization of classes of recursive functions

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)