Learning recursive languages from good examples

DOI10.1023/A:1018955906119zbMATH Open0913.68124OpenAlexW1684693274MaRDI QIDQ1273752FDOQ1273752

Authors S. Lange, J. Nessel, Rolf Wiehagen 

Publication date 23 March 1999

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018955906119

zbMATH Keywords

learningrecursive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2077176
• On the learnability of recursively enumerable languages from good examples
• scientific article; zbMATH DE number 1104342
• Learning indexed families of recursive languages from positive data: A survey
• A general comparison of language learning from examples and from queries

Cited In (7)

• Learning indexed families of recursive languages from positive data: A survey
• On the learnability of recursively enumerable languages from good examples
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• On the data consumption benefits of accepting increased uncertainty
• Automatic learning from positive data and negative counterexamples
• Title not available (Why is no real title available?)

This page was built for publication: Learning recursive languages from good examples

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