PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance

Palmer and Goldberg. "PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance." International Conference on Algorithmic Learning Theory, 2005. doi:10.1007/11564089_14

[Palmer and Goldberg. "PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance." International Conference on Algorithmic Learning Theory, 2005.](https://mlanthology.org/alt/2005/palmer2005alt-paclearnability/) doi:10.1007/11564089_14

@inproceedings{palmer2005alt-paclearnability,
  title     = {{PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance}},
  author    = {Palmer, Nick and Goldberg, Paul W.},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2005},
  pages     = {157-170},
  doi       = {10.1007/11564089_14},
  url       = {https://mlanthology.org/alt/2005/palmer2005alt-paclearnability/}
}