On the learnability of recursively enumerable languages from good examples

DOI10.1016/S0304-3975(00)00131-6zbMath0973.68090OpenAlexW2022718789MaRDI QIDQ5941366

Steffen Lange, Jochen Nessel, Sanjay Jain

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00131-6

zbMATH Keywords

computational learning theoryinductive inferencegood examples

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (4)

On the data consumption benefits of accepting increased uncertainty ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Teaching randomized learners with feedback ⋮ Recent Developments in Algorithmic Teaching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Elementary formal systems, intrinsic complexity, and procrastination
• Teachability in computational learning
• Prudence and other conditions on formal language learning
• Teaching a smarter learner.
• Finding patterns common to a set of strings
• Inductive inference from all positive and some negative data
• On the power of inductive inference from good examples
• Learning recursive languages from good examples
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• Incremental concept learning for bounded data mining.
• Language learning with some negative information
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: On the learnability of recursively enumerable languages from good examples