The following pages link to Learning Theory (Q4680873):
Displaying 11 items.
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Learning of erasing primitive formal systems from positive examples (Q860828) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Discontinuities in pattern inference (Q924176) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages (Q3517259) (← links)
- STACS 2004 (Q5309694) (← links)
- Developments in Language Theory (Q5711970) (← links)
- The equivalence problem of E-pattern languages with regular constraints is undecidable (Q6666804) (← links)
