Partial learning of recursively enumerable languages
From MaRDI portal
Publication:5964064
DOI10.1016/j.tcs.2015.10.035zbMath1335.68111OpenAlexW2209166757MaRDI QIDQ5964064
Frank Stephan, Sandra Zilles, Ziyuan Gao
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.035
confident learningconservative learningconsistent learningpartial learningrecursively enumerable languages
Cites Work
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- Some natural properties of strong-identification in inductive inference
- The synthesis of language learners.
- Characterizations of monotonic and dual monotonic language learning
- Partial Learning of Recursively Enumerable Languages
- Learning Families of Closed Sets in Matroids
- Confident and Consistent Partial Learning of Recursive Functions
- Learning strategies
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
- 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: Partial learning of recursively enumerable languages