| Automatic learning from positive data and negative counterexamples | 0 | 0.34 | 2017 |
| Intrinsic Complexity of Partial Learning. | 0 | 0.34 | 2016 |
| Parallel Learning of Automatic Classes of Languages. | 0 | 0.34 | 2014 |
| Mind Change Speed-up for Learning Languages from Positive Data. | 0 | 0.34 | 2013 |
| Learning regular expressions from representative examples and membership queries | 4 | 0.42 | 2010 |
| Inductive inference of languages from samplings | 0 | 0.34 | 2010 |
| One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples | 3 | 0.40 | 2009 |
| Iterative learning from texts and counterexamples using additional information | 2 | 0.37 | 2009 |
| On Learning Regular Expressions and Patterns Via Membership and Correction Queries | 6 | 0.46 | 2008 |
| Learning and extending sublanguages | 3 | 0.42 | 2008 |
| Learning languages from positive data and negative counterexamples | 9 | 0.48 | 2008 |
| Iterative learning from positive data and negative counterexamples | 5 | 0.43 | 2007 |
| Learning languages from positive data and a limited number of short counterexamples | 0 | 0.34 | 2007 |
| Learning multiple languages in groups | 1 | 0.42 | 2007 |
| Learning languages from positive data and a finite number of queries | 8 | 0.49 | 2006 |
| Variations on U-shaped learning | 9 | 0.58 | 2006 |
| On the classification of recursive languages | 1 | 0.36 | 2004 |
| On learning of functions refutably | 5 | 0.45 | 2003 |
| On the intrinsic complexity of learning recursive functions | 5 | 0.43 | 2003 |
| Intrinsic Complexity of Learning Geometrical Concepts from Positive Data | 1 | 0.35 | 2001 |
| Learning Recursive Functions Refutably | 2 | 0.36 | 2001 |
| Learning languages and functions by erasing | 3 | 0.39 | 2000 |
| Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations | 11 | 0.62 | 2000 |
| The functions of finite support: a canonical learning problem | 0 | 0.34 | 1999 |
| On the intrinsic complexity of learning recursive functions | 6 | 0.44 | 1999 |
| On the Classification of Computable Languages | 8 | 0.50 | 1997 |
| On Learning and Co-learning of Minimal Programs | 2 | 0.37 | 1996 |
| Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract) | 2 | 0.42 | 1995 |
| Frequency computation and bounded queries | 14 | 0.74 | 1995 |
| On the intrinsic complexity of learning | 33 | 1.30 | 1995 |
| Probabilistic versus Deterministic Memory Limited Learning | 2 | 0.41 | 1995 |
| Learning from Good Examples | 1 | 0.36 | 1995 |
| On the impact of forgetting on learning machines | 31 | 1.43 | 1995 |
| Learning recursive functions from approximations | 17 | 0.79 | 1995 |
| How inductive inference strategies discover their errors | 13 | 0.67 | 1995 |
| Learning Via Queries With Teams And Anomalies | 5 | 0.55 | 1995 |
| Error Detecting in Inductive Inference | 0 | 0.34 | 1995 |
| On learning multiple concepts in parallel | 10 | 0.70 | 1995 |
| Language learning from texts: mindchanges, limited memory, and monotonicity | 37 | 1.24 | 1995 |
| Monotonicity versus Efficiency for Learning Languages from Texts | 10 | 0.59 | 1994 |
| Extremes in the degrees of inferability | 30 | 1.18 | 1994 |
| Learning A Class of Regular Expressions via Restricted Subset Queries | 6 | 0.58 | 1992 |
| Degrees of inferability | 7 | 0.64 | 1992 |
| Some Models of Inductive Syntactical Synthesis from Sample Computations | 1 | 0.40 | 1991 |
| One-sided error probabilistic inductive inference and reliable frequency identification | 16 | 0.72 | 1991 |
| Dual Types of Hypotheses in Inductive Inference | 0 | 0.34 | 1991 |
| Some problems of learning with an oracle | 2 | 0.45 | 1990 |
| Learning via queries with teams and anomilies | 6 | 0.61 | 1990 |
| Monte-Carlo Inference and Its Relations to Reliable Frequency Identification | 0 | 0.34 | 1989 |
| Refined Query Inference (Extended Abstract) | 3 | 0.40 | 1989 |
