The following pages link to (Q4013526):
Displaying 20 items.
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- An average-case optimal one-variable pattern language learner (Q1567401) (← links)
- Regular patterns, regular languages and context-free languages (Q1675877) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515) (← links)
- Learning erasing pattern languages with queries (Q2581361) (← links)
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher (Q3167310) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries (Q3520065) (← links)
- (Q4282559) (← links)
- (Q5091271) (← links)
- (Q5136316) (← links)
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries (Q5941371) (← links)
- Co-learning of recursive languages from positive data (Q6570930) (← links)
