A general comparison of language learning from examples and from queries

DOI10.1016/j.tcs.2007.07.024zbMath1143.68023OpenAlexW2139701279MaRDI QIDQ2465036

Sanjay Jain, Sandra Zilles, Steffen Lange

Publication date: 19 December 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.024

zbMATH Keywords

formal languagesinductive inferencerecursion theoryquery learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (4)

Hypothesis spaces for learning ⋮ Hypothesis Spaces for Learning ⋮ One-shot learners using negative counterexamples and nearest positive examples ⋮ Necessary and sufficient conditions for learning with correction queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prudence and other conditions on formal language learning
• Queries revisited.
• Queries and concept learning
• Relations between Gold-style learning and query learning
• A theory of the learnable
• Computational limitations on learning from examples
• Inductive inference of formal languages from positive data
• Inductive inference and unsolvability
• Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Language identification in the limit

This page was built for publication: A general comparison of language learning from examples and from queries