On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

MLJ 1995 pp. 153-179

doi:10.1007/BF01007463 /mlj/1995/yokomori1995mlj-polynomialtime/

Cite

Text

Yokomori. "On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata." Machine Learning, 1995. doi:10.1007/BF01007463

Markdown

[Yokomori. "On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata." Machine Learning, 1995.](https://mlanthology.org/mlj/1995/yokomori1995mlj-polynomialtime/) doi:10.1007/BF01007463

BibTeX

@article{yokomori1995mlj-polynomialtime,
  title     = {{On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata}},
  author    = {Yokomori, Takashi},
  journal   = {Machine Learning},
  year      = {1995},
  pages     = {153-179},
  doi       = {10.1007/BF01007463},
  volume    = {19},
  url       = {https://mlanthology.org/mlj/1995/yokomori1995mlj-polynomialtime/}
}