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

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]

Abstract

Abstract is missing.