Q4918090
type: Item
instance of: scholarly article
zbMATH Open document ID: 1262.68092
author: Anuchit Jipattanakul
publication date: 2013-05-06T00:00:00Z
full work available at URL: 7233.htm
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 6160572
zbMATH Keywords: strictly \(k\)-acceptable languages
zbMATH Keywords: identification in the limit
zbMATH Keywords: learnability
zbMATH Keywords: grammatical inference
MaRDI profile type: Publication
Recommended article: Q5412234
Recommended article: Learnability: Admissible, co-finite, and hypersimple languages
Recommended article: Q4440403
Recommended article: Partial Learning of Recursively Enumerable Languages
Recommended article: Partial learning of recursively enumerable languages
Recommended article: On learnability of restricted classes of categorial grammars
Recommended article: On the learnability of recursively enumerable languages from good examples
Recommended article: On uniform learnability of language families
Recommended article: Language learnability in the limit: a generalization of Gold's theorem
description: scientific article; zbMATH DE number 6160572