Mind change speed-up for learning languages from positive data
From MaRDI portal
Publication:388110
DOI10.1016/j.tcs.2013.04.009zbMath1293.68179MaRDI QIDQ388110
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Learning recursive functions: A survey
- Finding patterns common to a set of strings
- Bounded queries to SAT and the Boolean hierarchy
- On the intrinsic complexity of learning
- Mind Change Speed-up for Learning Languages from Positive Data
- Automatic Learners with Feedback Queries
- Learnability of Automatic Classes
- The difference and truth-table hierarchies for NP
- On the complexity of inductive inference
- The Boolean Hierarchy I: Structural Properties
- Query Order
- The structure of intrinsic complexity of learning
- Inductive inference of recursive functions: Complexity bounds
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit