Learning of R. E. languages from good examples

DOI10.1007/3-540-63577-7_34MaRDI QIDQ4370215zbMATH OpenFDO

Authors Sanjay Jain, S. Lange, J. Nessel

Publication date 25 May 1998

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

Full work available at URL https://doi.org/10.1007/3-540-63577-7_34

zbMATH Keywords

class preserving learningrecursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the learnability of recursively enumerable languages from good examples
• scientific article; zbMATH DE number 2077176
• Learning recursive languages from good examples
• The synthesis of language learners.
• scientific article; zbMATH DE number 996380

Cited in

(10)

• Generalization and specialization strategies for learning r. e. languages
• Learning recursive languages from good examples
• A general comparison of language learning from examples and from queries
• Learning finite variants of single languages from informant
• scientific article; zbMATH DE number 2077153 (Why is no real title available?)
• scientific article; zbMATH DE number 2077176 (Why is no real title available?)
• scientific article; zbMATH DE number 2080663 (Why is no real title available?)
• On the learnability of recursively enumerable languages from good examples
• Synthesizing noise-tolerant language learners
• Measuring teachability using variants of the teaching dimension

This page was built for publication: Learning of R. E. languages from good examples

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