Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Prudence and other conditions on formal language learning
Information and Computation
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Learning via queries to an oracle
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
On the structure of degrees of inferability
Journal of Computer and System Sciences
Inductive inference of total functions
Computability, enumerability, unsolvability
Synthesizing enumeration techniques for language learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Angluin's theorem for indexed families of r.e. sets and applications
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Machine Inductive Inference and Language Identification
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Counting extensional differences in BC-learning
Information and Computation
| Hi-index | 0.00 |