Learning regular sets from queries and counterexamples D Angluin Information and computation 75 (2), 87-106, 1987 | 3047 | 1987 |

Queries and concept learning D Angluin Machine learning 2, 319-342, 1988 | 3032 | 1988 |

Inductive inference: Theory and methods D Angluin, CH Smith ACM computing surveys (CSUR) 15 (3), 237-269, 1983 | 1410 | 1983 |

Learning from noisy examples D Angluin, P Laird Machine learning 2, 343-370, 1988 | 1286 | 1988 |

Inductive inference of formal languages from positive data D Angluin Information and control 45 (2), 117-135, 1980 | 1172 | 1980 |

Fast probabilistic algorithms for Hamiltonian circuits and matchings D Angluin, LG Valiant Proceedings of the ninth annual ACM symposium on Theory of computing, 30-41, 1977 | 951 | 1977 |

Local and global properties in networks of processors D Angluin Proceedings of the twelfth annual ACM symposium on Theory of computing, 82-93, 1980 | 940 | 1980 |

Finding patterns common to a set of strings D Angluin Proceedings of the eleventh annual ACM Symposium on Theory of Computing, 130-141, 1979 | 899 | 1979 |

Computation in networks of passively mobile finite-state sensors D Angluin, J Aspnes, Z Diamadi, MJ Fischer, R Peralta Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004 | 780 | 2004 |

Inference of reversible languages D Angluin Journal of the ACM (JACM) 29 (3), 741-765, 1982 | 765 | 1982 |

Negative results for equivalence queries D Angluin Machine Learning 5, 121-150, 1990 | 376 | 1990 |

The computational power of population protocols D Angluin, J Aspnes, D Eisenstat, E Ruppert Distributed Computing 20 (4), 279-304, 2007 | 367 | 2007 |

When won't membership queries help? D Angluin, M Kharitonov Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 362 | 1991 |

On the complexity of minimum inference of regular sets D Angluin Information and control 39 (3), 337-350, 1978 | 360 | 1978 |

Two notions of correctness and their relation to testing TA Budd, D Angluin Acta informatica 18 (1), 31-45, 1982 | 355 | 1982 |

Queries revisited D Angluin Theoretical Computer Science 313 (2), 175-194, 2004 | 330 | 2004 |

Computational learning theory: survey and selected bibliography D Angluin Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 307 | 1992 |

Fast computation by population protocols with a leader D Angluin, J Aspnes, D Eisenstat Distributed Computing 21, 183-199, 2008 | 277 | 2008 |

Learning conjunctions of Horn clauses D Angluin, M Frazier, L Pitt Machine Learning 9, 147-164, 1992 | 272 | 1992 |

A simple population protocol for fast robust approximate majority D Angluin, J Aspnes, D Eisenstat Distributed Computing 21 (2), 87-102, 2008 | 258 | 2008 |