Relations between Gold-style learning and query learning

DOI10.1016/j.ic.2005.08.003zbMath1085.68072MaRDI QIDQ2581538

Sandra Zilles, Steffen Lange

Publication date: 10 January 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.08.003

zbMATH Keywords

Formal languages; Inductive inference; Recursion theory; Query learning

Mathematics Subject Classification ID

68Q32: Computational learning theory

68T05: Learning and adaptive systems in artificial intelligence

68Q45: Formal languages and automata

Related Items

Four one-shot learners for regular tree languages and their polynomial characterizability, Discontinuities in pattern inference, Learning indexed families of recursive languages from positive data: A survey, One-shot learners using negative counterexamples and nearest positive examples, Necessary and sufficient conditions for learning with correction queries, A general comparison of language learning from examples and from queries, One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prudence and other conditions on formal language learning
• Queries revisited.
• The synthesis of language learners.
• Queries and concept learning
• Formal language identification: query learning vs. gold-style learning
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Algorithmic Learning Theory