SOME SUFFICIENT CONDITIONS OF LEARNABILITY IN THE LIMIT FROM POSITIVE DATA

DOI10.1142/S0129054100000284zbMath1320.68105OpenAlexW2117139393MaRDI QIDQ5249053

Takesi Okadome

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054100000284

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Language identification in the limit

This page was built for publication: SOME SUFFICIENT CONDITIONS OF LEARNABILITY IN THE LIMIT FROM POSITIVE DATA