A polynomial-time algorithm for learning k-variable pattern languages from examples

Michael Kearns, Leonard Pitt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationProceedings of the 2nd Annual Workshop on Computational Learning Theory, COLT 1989
PublisherAssociation for Computing Machinery, Inc
Pages57-71
Number of pages15
ISBN (Electronic)1558600868, 9781558600867
DOIs
StatePublished - Dec 1 1989
Event2nd Annual Workshop on Computational Learning Theory, COLT 1989 - Santa Cruz, United States
Duration: Jul 31 1989Aug 2 1989

Publication series

NameProceedings of the 2nd Annual Workshop on Computational Learning Theory, COLT 1989

Conference

Conference2nd Annual Workshop on Computational Learning Theory, COLT 1989
CountryUnited States
CitySanta Cruz
Period7/31/898/2/89

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Artificial Intelligence

Cite this

Kearns, M., & Pitt, L. (1989). A polynomial-time algorithm for learning k-variable pattern languages from examples. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory, COLT 1989 (pp. 57-71). (Proceedings of the 2nd Annual Workshop on Computational Learning Theory, COLT 1989). Association for Computing Machinery, Inc. https://doi.org/10.1016/b978-0-08-094829-4.50007-6