Learning languages in the limit from positive information with finitely many memory changes

DOI10.1007/978-3-030-80049-9_29OpenAlexW3186664975MaRDI QIDQ2117794FDOQ2117794

Karen Seidel, Timo Kötzing

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2010.04782

zbMATH Keywords

(strongly) non-U-shaped learningmap for bounded memory states learnersmemory restricted learning algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Incremental learning from positive data
• Learning without coding
• Results on memory-limited U-shaped learning
• On the role of update constraints and text-types in iterative learning
• Learning strategies
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• When unlearning helps
• Classical recursion theory. Vol. II
• A map of update constraints in inductive inference
• Periodicity in generations of automata
• Title not available (Why is that?)
• Infinitary self-reference in learning theory
• Title not available (Why is that?)
• Optimal language learning from positive data
• Incremental concept learning for bounded data mining.
• Memory-limited non-U-shaped learning with solved open problems
• Strongly non-U-shaped language learning results by general techniques
• Some natural conditions on incremental learning
• U-Shaped, Iterative, and Iterative-with-Counter Learning
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Storage of linguistic information in a continuous classifying associative memory

This page was built for publication: Learning languages in the limit from positive information with finitely many memory changes

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