Learning regular languages from counterexamples

[1]  Assaf Marron,et al.  Learning pattern languages from a single initial example and from queries , 1988, Annual Conference Computational Learning Theory.

[2]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[3]  Piotr Berman,et al.  Learning one-counter languages in polynomial time , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Assaf Marron,et al.  Identification of Pattern Languages from Examples and Queries , 1987, Inf. Comput..

[5]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[6]  Dana Angluin,et al.  A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

[7]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .