论文信息 - Learning Regular Sets with an Incomplete Membership Oracle

Learning Regular Sets with an Incomplete Membership Oracle

This paper gives an "efficient" algorithm for learning deterministic finite automata by using an equivalence oracle and an incomplete membership oracle. This solves an open problem that was posed by Angluin and Slonim in 94.

Nader H. Bshouty | Avi Owshanko | N. Bshouty | Avi Owshanko

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

[2] Eyal Kushilevitz,et al. On learning Read-k-Satisfy-j DNF , 1994, COLT '94.

[3] D. Angluin. Queries and Concept Learning , 1988 .

[4] Eyal Kushilevitz,et al. A Simple Algorithm for Learning O (log n)-Term DNF , 1997, Inf. Process. Lett..

[5] Zhixiang Chen. A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership Queries , 1994, AII/ALT.

[6] N. Bshouty,et al. Learning monotone dnf from a teacher that almost does not answer membership queries , 2003 .

[7] Eyal Kushilevitz,et al. On the applications of multiplicity automata in learning , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[8] D. Angluin,et al. Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle , 1991, Machine Learning.

[9] György Turán,et al. Learning with queries but incomplete information (extended abstract) , 1994, COLT '94.

[10] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.

[11] Leslie G. Valiant,et al. Cryptographic limitations on learning Boolean formulae and finite automata , 1994, JACM.

[12] Sally A. Goldman,et al. Learning k-term DNF formulas with an incomplete membership oracle , 1992, COLT '92.

[13] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .