Formal language identification: query learning vs. gold-style learning

DOI10.1016/j.ipl.2004.05.010zbMath1178.68427OpenAlexW2080044688MaRDI QIDQ2390327

Sandra Zilles, Steffen Lange

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.05.010

zbMATH Keywords

formal languagesquery learninggold-style learning

Mathematics Subject Classification ID

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

Related Items (10)

Robust learning of automatic classes of languages ⋮ A theory of formal synthesis via inductive learning ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples ⋮ A Note on the Relationship between Different Types of Correction Queries ⋮ 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 ⋮ Relations between Gold-style learning and query learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Queries and concept learning
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Learning Theory
• Language identification in the limit

This page was built for publication: Formal language identification: query learning vs. gold-style learning