Skip to main content
SpringerLink
Log in

Learning Regular Sets with an Incomplete Membership Oracle

  • Conference paper
  • First Online:
Computational Learning Theory (COLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2111))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin. (1987). Learning Regular Sets from Queries and Counterexamples. Information and Computation, 75:87–106.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Angluin. (1988). Queries and Concept Learning. Machine Learning, 2:319–342.

    Google Scholar 

  3. D. Angluin. (1990). Negative Results for Equivalence Queries. Machine Learning, 5:121–150.

    Google Scholar 

  4. D. Angluin and D.K. Slonim. (1994). Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle. Machine Learning, 14:7–26.

    MATH  Google Scholar 

  5. D. Angluin, M. Kriķis, R.H. Sloan and G. Turán. (1997). Malicious Omissions and Errors in Answers to Membership Queries. Machine Learning, 28:211–255.

    Article  MATH  Google Scholar 

  6. A. Beimel, F. Bergadoano, N.H. Bshouty and E. Kushilevitz. (1996) On the Application of Multiplicity automaton in Learning. FOCS96, 349–358.

    Google Scholar 

  7. A. Blum, R. Khardon, E. Kushilevitz, L. Pitt and D. Roth. (1994). On Learning Read-k-Satisfy-j DNF. COLT94, 110–117.

    Google Scholar 

  8. N.H. Bshouty (1997). Simple Learning Algorithms using Divide and Conquer. Computational Complexity, 6:174–194.

    Article  MathSciNet  Google Scholar 

  9. N.H. Bshouty and N. Einon. Learning Monotone DNF from a Teacher that almost does not answer membership queries Manuscript.

    Google Scholar 

  10. Z. Chen. (1994). A note on learning DNF formulas using Equivalence and Incomplete Membership Queries. AII/ALT, 272–281.

    Google Scholar 

  11. M. Kearns and L. Valient. (1994). Cryptographic Limitations on Learning Boolean Formulae and Finite automaton. Journal of the Association for Computing Machinery, 41:67–95.

    MATH  MathSciNet  Google Scholar 

  12. M. Kearns and U. Vazirani. “An introduction to Computational Learning Theory”. MIT Press, 1994.

    Google Scholar 

  13. E. Kushilevitz. (1996). A Simple Algorithm for Learning O(log n)-Term DNF. COLT96, 266–269.

    Google Scholar 

  14. R.L. Rivest and R.E. Schapire. (1993). Inference of Finite automaton Using Homing Sequences. Information and Computation, 103(2):299–347.

    Article  MATH  MathSciNet  Google Scholar 

  15. R.H. Sloan and G. Turan. (1994). Learning with Queries but Incomplete Information. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 237–245

    Google Scholar 

  16. S.A. Goldman and H.D. Mathias. (1992). Learning k-term DNF formulas with an incomplete membership oracle. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 77–84.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of computer science, Technion, 32000, Haifa, Israel

    Nader Bshouty & Avi Owshanko

Authors
  1. Nader Bshouty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avi Owshanko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Department of Computer Science, University of California, Santa Cruz, Santa Cruz, CA, 95064, USA

    David Helmbold

  2. Research School of Information Sciences and Engineering Department of Telecommunications Engineering, Australian National University, Canberra, 0200, Australia

    Bob Williamson

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bshouty, N., Owshanko, A. (2001). Learning Regular Sets with an Incomplete Membership Oracle. In: Helmbold, D., Williamson, B. (eds) Computational Learning Theory. COLT 2001. Lecture Notes in Computer Science(), vol 2111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44581-1_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-44581-1_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42343-0

  • Online ISBN: 978-3-540-44581-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation