Angluin's theorem for indexed families of r.e. sets and applications
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
Theoretical Computer Science
Finding consistent categorial grammars of bounded value: a parameterized approach
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
Hi-index | 0.00 |