On the Computational Complexity of Approximating Distributions by Probabilistic Automata

Abe and Warmuth. "On the Computational Complexity of Approximating Distributions by Probabilistic Automata." Annual Conference on Computational Learning Theory, 1990. doi:10.1007/BF00992677

[Abe and Warmuth. "On the Computational Complexity of Approximating Distributions by Probabilistic Automata." Annual Conference on Computational Learning Theory, 1990.](https://mlanthology.org/colt/1990/abe1990colt-computational/) doi:10.1007/BF00992677

@inproceedings{abe1990colt-computational,
  title     = {{On the Computational Complexity of Approximating Distributions by Probabilistic Automata}},
  author    = {Abe, Naoki and Warmuth, Manfred K.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1990},
  pages     = {52-66},
  doi       = {10.1007/BF00992677},
  url       = {https://mlanthology.org/colt/1990/abe1990colt-computational/}
}