Learning languages with decidable hypotheses

DOI10.1007/978-3-030-80049-9_3MaRDI QIDQ2117759zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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.

Cites work

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

Cited in

(15)

• Learning languages and functions by erasing
• Angluin learning via logic
• Three Learnable Models for the Description of Language
• scientific article; zbMATH DE number 2080663 (Why is no real title available?)
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lower bounds on () and other properties of -register machines
• Reifying dynamical algebra: maximal ideals in countable rings, constructively
• Maps for learning indexable classes
• Prudence and other conditions on formal language learning

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)