A Polynomial-Time Algorithm for Learning K-Variable Pattern Languages from Examples

Cite

Text

Kearns and Pitt. "A Polynomial-Time Algorithm for Learning K-Variable Pattern Languages from Examples." Annual Conference on Computational Learning Theory, 1989. doi:10.1016/B978-0-08-094829-4.50007-6

Markdown

[Kearns and Pitt. "A Polynomial-Time Algorithm for Learning K-Variable Pattern Languages from Examples." Annual Conference on Computational Learning Theory, 1989.](https://mlanthology.org/colt/1989/kearns1989colt-polynomial/) doi:10.1016/B978-0-08-094829-4.50007-6

BibTeX

@inproceedings{kearns1989colt-polynomial,
  title     = {{A Polynomial-Time Algorithm for Learning K-Variable Pattern Languages from Examples}},
  author    = {Kearns, Michael J. and Pitt, Leonard},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1989},
  pages     = {57-71},
  doi       = {10.1016/B978-0-08-094829-4.50007-6},
  url       = {https://mlanthology.org/colt/1989/kearns1989colt-polynomial/}
}