Formal language identification: query learning vs. gold-style learning
From MaRDI portal
Publication:2390327
Recommendations
Cites work
- scientific article; zbMATH DE number 2080442 (Why is no real title available?)
- scientific article; zbMATH DE number 2080645 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A theory of the learnable
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning Theory
- Queries and concept learning
Cited in
(12)- Robust learning of automatic classes of languages
- A theory of formal synthesis via inductive learning
- Relations between Gold-style learning and query learning
- One-shot learners using negative counterexamples and nearest positive examples
- Discontinuities in pattern inference
- Necessary and sufficient conditions for learning with correction queries
- Algorithmic Learning Theory
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Learning indexed families of recursive languages from positive data: A survey
- One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
- Learning Theory
- A Note on the Relationship between Different Types of 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)