Probabilistic inductive inference
Journal of the ACM (JACM)
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
On the intrinsic complexity of language identification
COLT '94 Proceedings of the seventh 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
Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Extensional set learning (extended abstract)
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
On the learnability of recursively enumerable languages from good examples
Theoretical Computer Science
Synthesizing noise-tolerant language learners
Theoretical Computer Science
Learning algebraic structures from text
Theoretical Computer Science - Algorithmic learning theory
Closedness properties in ex-identification
Theoretical Computer Science - Algorithmic learning theory
Inductive inference with additional information
Journal of Computer and System Sciences
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
Synthesizing Learners Tolerating Computable Noisy Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Recursive Concepts with Anomalies
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning by switching type of information
Information and Computation
Intrinsic complexity of learning geometrical concepts from positive data
Journal of Computer and System Sciences
Hypothesis formation and language acquisition with an infinitely-often correct teacher
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
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
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
Results on memory-limited U-shaped learning
Information and Computation
A general comparison of language learning from examples and from queries
Theoretical Computer Science
Learning multiple languages in groups
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 languages from positive data and negative counterexamples
Journal of Computer and System Sciences
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Learning and extending sublanguages
Theoretical Computer Science
Learning in Friedberg numberings
Information and Computation
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Parallelism Increases Iterative Learning Power
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
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
Prescribed learning of r.e. classes
Theoretical Computer Science
Parallelism increases iterative learning power
Theoretical Computer Science
Hypothesis Spaces for Learning
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
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
COLT'07 Proceedings of the 20th annual conference on Learning theory
Iterative learning of simple external contextual languages
Theoretical Computer Science
Iterative learning from texts and counterexamples using additional information
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Solutions to open questions for non-u-shaped learning with memory limitations
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
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Learning and extending sublanguages
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
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
Learning multiple languages in groups
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
On learning languages from positive data and a limited number of short counterexamples
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Some recent results in u-shaped learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Variations on u-shaped learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Learning languages from positive data and a finite number of queries
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
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
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
Memory-limited non-U-shaped learning with solved open problems
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.01 |