Optimal language learning from positive data

DOI10.1016/j.ic.2011.07.003zbMath1235.68091OpenAlexW1974227725MaRDI QIDQ642522

Samuel E. III Moelius, John Case

Publication date: 27 October 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.07.003

zbMATH Keywords

inductive inferencelanguage learningoptimal learningstrongly non-U-shaped learning

Mathematics Subject Classification ID

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

Related Items (4)

A map of update constraints in inductive inference ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ Towards a map for incremental learning in the limit from positive and negative information ⋮ Learning languages in the limit from positive information with finitely many memory changes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Prudence and other conditions on formal language learning
• When unlearning helps
• Non-U-shaped vacillatory and team learning
• U-shaped, iterative, and iterative-with-counter learning
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• Results on memory-limited U-shaped learning
• Learning strategies
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Inductive inference of automata, functions and programs
• Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: Optimal language learning from positive data