Learning languages with decidable hypotheses

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

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

Publication date: 22 March 2022

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

Recommendations

• Learnability of co-r.e. classes
• The synthesis of language learners.
• Co-learning of recursive languages from positive data
• On the learnability of recursively enumerable languages from good examples
• Learning power and language expressiveness.

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (5)

• Prudence and other conditions on formal language learning
• Three Learnable Models for the Description of Language
• Title not available (Why is that?)
• Learning languages and functions by erasing
• Angluin learning via logic

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

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