Learnability: Admissible, co-finite, and hypersimple languages
From MaRDI portal
Publication:1816739
DOI10.1006/JCSS.1996.0047zbMath0859.68087OpenAlexW2127831427MaRDI QIDQ1816739
Publication date: 13 March 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0047
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (3)
Topological separations in inductive inference ⋮ Maximal machine learnable classes ⋮ The synthesis of language learners.
This page was built for publication: Learnability: Admissible, co-finite, and hypersimple languages