Skip to main content
Conference Proceedings

Learning regular sets with an incomplete membership oracle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2111 574-588
DOI: 10.1007/3-540-44581-1_38
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Bshouty, N., & Owshanko, A. (2001). Learning regular sets with an incomplete membership oracle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2111, pp. 574–588). Springer Verlag. https://doi.org/10.1007/3-540-44581-1_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free