pith. sign in

arxiv: 0907.0453 · v2 · submitted 2009-07-02 · 💻 cs.LG

Random DFAs are Efficiently PAC Learnable

classification 💻 cs.LG
keywords angluinbeendanadfasefficientlyerrorfoundlearnable
0
0 comments X
read the original abstract

This paper has been withdrawn due to an error found by Dana Angluin and Lev Reyzin.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.