Formal language identification: query learning vs. gold-style learning
From MaRDI portal
Publication:2390327
DOI10.1016/J.IPL.2004.05.010zbMATH Open1178.68427OpenAlexW2080044688MaRDI QIDQ2390327FDOQ2390327
Authors: S. Lange, Sandra Zilles
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Cites Work
Cited In (12)
- Robust learning of automatic classes of languages
- One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
- Learning indexed families of recursive languages from positive data: A survey
- A theory of formal synthesis via inductive learning
- Learning Theory
- Relations between Gold-style learning and query learning
- Discontinuities in pattern inference
- A Note on the Relationship between Different Types of Correction Queries
- One-shot learners using negative counterexamples and nearest positive examples
- Algorithmic Learning Theory
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Necessary and sufficient conditions for learning with correction queries
This page was built for publication: Formal language identification: query learning vs. gold-style learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390327)