Nick Palmer, Paul W. Goldberg. PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance. In Sanjay Jain, Hans-Ulrich Simon, Etsuji Tomita, editors, Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings. Volume 3734 of Lecture Notes in Computer Science, pages 157-170, Springer, 2005. [doi]
@inproceedings{PalmerG05,
title = {PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance},
author = {Nick Palmer and Paul W. Goldberg},
year = {2005},
doi = {10.1007/11564089_14},
url = {http://dx.doi.org/10.1007/11564089_14},
researchr = {https://researchr.org/publication/PalmerG05},
cites = {0},
citedby = {0},
pages = {157-170},
booktitle = {Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings},
editor = {Sanjay Jain and Hans-Ulrich Simon and Etsuji Tomita},
volume = {3734},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-29242-X},
}