Partial learning of recursively enumerable languages

DOI10.1007/978-3-642-40935-6_9MaRDI QIDQ2859210zbMATH OpenOpenAlexFDO

Authors Ziyuan Gao, Sandra Zilles, Frank Stephan

Publication date 6 November 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-40935-6_9

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• Partial learning of recursively enumerable languages
• A survey on recent results on partial learning
• On conservative learning of recursively enumerable languages
• Confident and Consistent Partial Learning of Recursive Functions
• Confident and consistent partial learning of recursive functions

Cited in

(14)

• A solution to Wiehagen's thesis
• Combining models of approximation with partial learning
• A solution to Wiehagen's thesis
• A survey on recent results on partial learning
• Learning Left-to-Right and Right-to-Left Iterative Languages
• scientific article; zbMATH DE number 2040913 (Why is no real title available?)
• Confident and consistent partial learning of recursive functions
• Set-driven and rearrangement-independent learning of recursive languages
• scientific article; zbMATH DE number 6160572 (Why is no real title available?)
• On conservative learning of recursively enumerable languages
• On the learnability of recursively enumerable languages from good examples
• Partial learning of recursively enumerable languages
• Learning of restricted RNLC graph languages
• Learning indexed families of recursive languages from positive data: A survey

This page was built for publication: Partial learning of recursively enumerable languages

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