Pages that link to "Item:Q912648"
From MaRDI portal
The following pages link to Prudence and other conditions on formal language learning (Q912648):
Displaying 50 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- A map of update constraints in inductive inference (Q329603) (← links)
- Parallel learning of automatic classes of languages (Q329605) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- Optimal language learning from positive data (Q642522) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Language learning without overgeneralization (Q673781) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- Learning languages in a union (Q859985) (← links)
- When unlearning helps (Q924730) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Numberings optimal for learning (Q972383) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- Incremental learning with temporary memory (Q982647) (← links)
- On some open problems in monotonic and conservative learning (Q989527) (← links)
- U-shaped, iterative, and iterative-with-counter learning (Q1009263) (← links)
- Algorithms for learning regular expressions from positive data (Q1013092) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- Learning with refutation (Q1278041) (← links)
- Learning in the presence of inaccurate information (Q1351959) (← links)
- Learning how to separate. (Q1426149) (← links)
- Learning by switching type of information. (Q1427864) (← links)
- Language learning from texts: Degrees of intrinsic complexity and their characterizations (Q1604194) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Recursion theoretic models of learning: Some results and intuitions (Q1924732) (← links)
- Learning languages with decidable hypotheses (Q2117759) (← links)
- Mapping monotonic restrictions in inductive inference (Q2117774) (← links)
- Iterative learning from positive data and negative counterexamples (Q2464142) (← links)
- A general comparison of language learning from examples and from queries (Q2465036) (← links)
- Learning languages from positive data and a limited number of short counterexamples (Q2465639) (← links)
- Learning languages from positive data and a finite number of queries (Q2490120) (← links)
- Variations on U-shaped learning (Q2500523) (← links)
- Inductive inference of approximations for recursive concepts (Q2581360) (← links)
- Relations between Gold-style learning and query learning (Q2581538) (← links)
- Priced Learning (Q2835616) (← links)
- Learning Families of Closed Sets in Matroids (Q2891307) (← links)
- Gold-Style Learning Theory (Q2963592) (← links)
- Robust separations in inductive inference (Q3011108) (← links)
- Prescribed Learning of R.E. Classes (Q3520050) (← links)
- Learning in Friedberg Numberings (Q3520051) (← links)
- Iterative Learning of Simple External Contextual Languages (Q3529934) (← links)
- Numberings Optimal for Learning (Q3529939) (← links)
- Hypothesis Spaces for Learning (Q3618566) (← links)
