Learning languages with decidable hypotheses
From MaRDI portal
Publication:2117759
Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A map of update constraints in inductive inference
- Criteria of language learning
- 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
(5)
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)