Pages that link to "Item:Q2490120"
From MaRDI portal
The following pages link to Learning languages from positive data and a finite number of queries (Q2490120):
Displaying 10 items.
- Learning via finitely many queries (Q812396) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Learning tree languages from positive examples and membership queries (Q2381576) (← 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)
- A family of languages which is polynomial-time learnable from positive data in pitt's sense (Q2710786) (← links)
- Learning from Positive Data and Negative Counterexamples: A Survey (Q2944899) (← links)
- Algorithmic Learning Theory (Q5464523) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465868) (← links)