ML Anthology

Which Classes of Elementary Formal Systems Are Polynomial-Time Learnable

Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara
ALT 1991 pp. 139-150
/alt/1991/miyano1991alt-classes/
Semantic Scholar

Cite

Text

Miyano et al. "Which Classes of Elementary Formal Systems Are Polynomial-Time Learnable." International Conference on Algorithmic Learning Theory, 1991.

Markdown

[Miyano et al. "Which Classes of Elementary Formal Systems Are Polynomial-Time Learnable." International Conference on Algorithmic Learning Theory, 1991.](https://mlanthology.org/alt/1991/miyano1991alt-classes/)

BibTeX

@inproceedings{miyano1991alt-classes,
  title     = {{Which Classes of Elementary Formal Systems Are Polynomial-Time Learnable}},
  author    = {Miyano, Satoru and Shinohara, Ayumi and Shinohara, Takeshi},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1991},
  pages     = {139-150},
  url       = {https://mlanthology.org/alt/1991/miyano1991alt-classes/}
}