Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICML

1999

IEEE

1999

IEEE

E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to be hard. Pitt, in his seminal paper posed the following open research problem: \Are DFA PAC-identi able if examples are drawn from the uniform distribution, or some other known simple distribution?" (Pitt, 1989). We demonstrate that the class of simple DFA (i.e., DFA whose canonical representations have logarithmic Kolmogorov complexity) is e ciently probably exactly learnable under the Solomono Levin universal distribution m(wherein an instance x with Kolmogorov complexity K(x) is sampled with probability that is proportional to 2;K(x) ). The simple distribution independent learning theorem states that a concept class is learnable under the universal distribution m i it is learnable under the entire class of simple distributions provided the examples are drawn accordingto the universaldistribution (Li &a...

Related Content

Added |
17 Nov 2009 |

Updated |
17 Nov 2009 |

Type |
Conference |

Year |
1999 |

Where |
ICML |

Authors |
Rajesh Parekh, Vasant Honavar |

Comments (0)