Learning languages with decidable hypotheses

DOI10.1007/978-3-030-80049-9_3OpenAlexW3178456349MaRDI QIDQ2117759

Julian Berger, Armin Wells, Winfried Lötzsch, Vanja Doskoč, Maximilian Böther, Simon Wietheger, Jonathan Gadea Harder, Jannik Peters, Leon Schiller, Nicolas Klodt, Lars Seifert, Timo Kötzing

Publication date: 22 March 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A map of update constraints in inductive inference
• Strongly non-U-shaped language learning results by general techniques
• Prudence and other conditions on formal language learning
• Learning indexed families of recursive languages from positive data: A survey
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Results on memory-limited U-shaped learning
• Toward a mathematical theory of inductive inference
• Criteria of language learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning languages with decidable hypotheses