Types of monotonic language learning and their characterization
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Probability is more powerful than team for language identification from positive data
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Vacillatory learning of nearly minimal size grammars
Journal of Computer and System Sciences
Regular Article: Open problems in “systems that learn”
Proceedings of the 30th IEEE symposium on Foundations of computer science
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
Extensional set learning (extended abstract)
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
On the learnability of recursively enumerable languages from good examples
Theoretical Computer Science
Theoretical Computer Science
Control structures in hypothesis spaces: the influence on learning
Theoretical Computer Science
Generalization and specialization strategies for learning r.e. languages
Annals of Mathematics and Artificial Intelligence
Stochastic Finite Learning of the Pattern Languages
Machine Learning
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Recursive Concepts with Anomalies
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning by switching type of information
Information and Computation
Theoretical Computer Science - Special issue: Algorithmic learning theory
Classes with easily learnable subclasses
Information and Computation
Learning all subfunctions of a function
Information and Computation
Relations between gold-style learning and query learning
Information and Computation
Learning languages from positive data and a finite number of queries
Information and Computation
Inductive inference of approximations for recursive concepts
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Variations on U-shaped learning
Information and Computation
Journal of Computer and System Sciences
A general comparison of language learning from examples and from queries
Theoretical Computer Science
Iterative learning from positive data and negative counterexamples
Information and Computation
Learning languages from positive data and a limited number of short counterexamples
Theoretical Computer Science
Information and Computation
Non-U-shaped vacillatory and team learning
Journal of Computer and System Sciences
Learning in Friedberg numberings
Information and Computation
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
Prescribed Learning of R.E. Classes
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Learning in Friedberg Numberings
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Iterative Learning of Simple External Contextual Languages
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Numberings Optimal for Learning
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Algorithms for learning regular expressions from positive data
Information and Computation
Prescribed learning of r.e. classes
Theoretical Computer Science
Hypothesis Spaces for Learning
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On some open problems in monotonic and conservative learning
Information Processing Letters
Relations between Gold-style learning and query learning
Information and Computation
Learning languages from positive data and a finite number of queries
Information and Computation
Numberings optimal for learning
Journal of Computer and System Sciences
U-shaped, iterative, and iterative-with-counter learning
COLT'07 Proceedings of the 20th annual conference on Learning theory
COLT'07 Proceedings of the 20th annual conference on Learning theory
Iterative learning of simple external contextual languages
Theoretical Computer Science
Incremental learning with temporary memory
Theoretical Computer Science
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Inductive inference of languages from samplings
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Hypothesis spaces for learning
Information and Computation
Optimal language learning from positive data
Information and Computation
Iterative learning from positive data and negative counterexamples
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Gold-style and query learning under various constraints on the target class
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Non U-shaped vacillatory and team learning
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Variations on u-shaped learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Learning families of closed sets in matroids
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Learnability of co-r.e. classes
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Memory-limited non-U-shaped learning with solved open problems
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.01 |