# Dana Angluin

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**We consider the problem of using queries to learn an unknown concept. Several types of queries are described and studied: membership, equivalence, subset, superset, disjointness, and exhaustiveness… Expand

We consider inductive inference of formal languages, as defined by Gold (1967) , in the case of positive data, i.e., when the examples of a given formal language are successive elements of some… Expand

Abstract Assume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable symbols . A pattern is a non-null finite string of constant and variable symbols. The language of a… Expand

The problem of identifying an unknown regular set from examples of its members and nonmembers is addressed. It is assumed that the regular set is presented by a minimaMy adequate Teacher, which can… Expand

The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on pairwise interactions of finite-state agents in populations of finite… Expand

Abstract We describe and analyse three simple efficient algorithms with good probabilistic behaviour; two algorithms with run times of O ( n (log n ) 2 ) which almost certainly find directed… Expand

A famdy of efficient algorithms for referring certain subclasses of the regular languages from fmtte posttwe samples is presented These subclasses are the k-reversible languages, for k = 0, 1, 2, . .… Expand

This paper attempts to get at some of the fundamental properties of distributed computing by means of the following question: “How much does each processor in a network of processors need to know… Expand

The basic question addressed in this paper is: how can a learning algorithm cope with incorrect training examples? Specifically, how can algorithms that produce an “approximately correct”… Expand

There has been a great deal of theoretical and experimental work in computer science on inductive inference systems, that is, systems that try to infer general rules from examples. However, a… Expand