Mind change speed-up for learning languages from positive data
From MaRDI portal
Publication:388110
DOI10.1016/J.TCS.2013.04.009zbMATH Open1293.68179OpenAlexW2128984219MaRDI QIDQ388110FDOQ388110
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.009
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language identification in the limit
- Finding patterns common to a set of strings
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the intrinsic complexity of learning
- The difference and truth-table hierarchies for NP
- The structure of intrinsic complexity of learning
- The Boolean Hierarchy I: Structural Properties
- Bounded queries to SAT and the Boolean hierarchy
- Comparison of identification criteria for machine inductive inference
- Learning recursive functions: A survey
- Mind change speed-up for learning languages from positive data
- Automatic Learners with Feedback Queries
- Learnability of Automatic Classes
- On the complexity of inductive inference
- Query Order
- Inductive inference of recursive functions: Complexity bounds
Cited In (1)
This page was built for publication: Mind change speed-up for learning languages from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388110)