Mind change speed-up for learning languages from positive data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 4049027 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 512873 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Automatic Learners with Feedback Queries
- Bounded queries to SAT and the Boolean hierarchy
- Comparison of identification criteria for machine inductive inference
- Finding patterns common to a set of strings
- Inductive inference of recursive functions: complexity bounds
- Language identification in the limit
- Learnability of automatic classes
- Learning recursive functions: A survey
- Mind change speed-up for learning languages from positive data
- On the complexity of inductive inference
- On the intrinsic complexity of learning
- Query Order
- The Boolean Hierarchy I: Structural Properties
- The difference and truth-table hierarchies for NP
- The structure of intrinsic complexity of learning
Cited in
(5)
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)