Prescribed learning of r.e. classes

DOI10.1016/J.TCS.2009.01.011zbMath1167.68026OpenAlexW2105329810MaRDI QIDQ1017658

Nan Ye, Frank Stephan, Sanjay Jain

Publication date: 12 May 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.011

zbMATH Keywords

formal languagesinductive inferencerecursion theoryprescribed learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (2)

Hypothesis spaces for learning ⋮ Learnability and positive equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and dual monotonic language learning
• Prudence and other conditions on formal language learning
• When unlearning helps
• Learning in Friedberg numberings
• Classical recursion theory. The theory of functions and sets of natural numbers
• Separation of uniform learning classes.
• Increasing the power of uniform inductive learners
• Characterizations of monotonic and dual monotonic language learning
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Learning strategies
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Prudence in vacillatory language identification
• Language identification in the limit
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Prescribed learning of r.e. classes