Learning recursive languages from good examples

DOI10.1023/A:1018955906119zbMath0913.68124OpenAlexW1684693274MaRDI QIDQ1273752

Steffen Lange, Rolf Wiehagen, Jochen Nessel

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)

Related Items (4)

On the data consumption benefits of accepting increased uncertainty ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Automatic learning from positive data and negative counterexamples ⋮ On the learnability of recursively enumerable languages from good examples

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