Learning finite variants of single languages from informant

DOI10.1007/978-3-319-46379-7_11MaRDI QIDQ2830274zbMATH OpenOpenAlexFDO

Authors Klaus Ambos-Spies

Publication date 9 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-46379-7_11

Mathematics Subject Classification ID

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

Recommendations

• On an open problem in classification of languages
• scientific article; zbMATH DE number 1104342
• Learning automatic families of languages
• Learning languages in a union
• On the learnability of recursively enumerable languages from good examples

Cites work

• A Completely Mitotic Nonrecursive R.E. Degree
• Completely mitotic r. e. degrees
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Mitotic recursively enumerable sets
• Toward a mathematical theory of inductive inference

This page was built for publication: Learning finite variants of single languages from informant

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