scientific article; zbMATH DE number 6160572

zbMATH Open1262.68092MaRDI QIDQ4918090

Anuchit Jipattanakul

Publication date: 6 May 2013

Full work available at URL: http://www.pphmj.com/abstract/7233.htm

Title of this publication is not available (Why is that?)

zbMATH Keywords

grammatical inferenceidentification in the limitlearnabilitystrictly \(k\)-acceptable languages

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (1)

On uniform learnability of language families

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On uniform learnability of language families 👍 👎
• Learnability: Admissible, co-finite, and hypersimple languages 👍 👎
• On learnability of restricted classes of categorial grammars 👍 👎
• Partial Learning of Recursively Enumerable Languages 👍 👎
• Learnability: Admissible, co-finite, and hypersimple languages 👍 👎
• On the learnability of recursively enumerable languages from good examples 👍 👎
• Partial learning of recursively enumerable languages 👍 👎
• Language learnability in the limit: a generalization of Gold's theorem 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918090)