Combining Models of Approximation with Partial Learning
From MaRDI portal
Publication:2835617
DOI10.1007/978-3-319-24486-0_4zbMath1471.68102arXiv1507.01215OpenAlexW2259618946MaRDI QIDQ2835617
Ziyuan Gao, Sandra Zilles, Frank Stephan
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01215
Computational learning theory (68Q32) Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (2)
Cites Work
- Unnamed Item
- Learning and classifying
- Comparison of identification criteria for machine inductive inference
- Belief revision in the service of scientific discovery
- Approximate inference and scientific method
- Partial Learning of Recursively Enumerable Languages
- Learning strategies
- Inductive inference of formal languages from positive data
- On Conservative Learning of Recursively Enumerable Languages
- Language identification in the limit
This page was built for publication: Combining Models of Approximation with Partial Learning