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

ALT

2015

Springer

2015

Springer

Deterministic ﬁnite automata (DFA) have long served as a fundamental computational model in the study of theoretical computer science, and the problem of learning a DFA from given input data is a classic topic in computational learning theory. In this paper we study the learnability of a random DFA and propose a computationally eﬃcient algorithm for learning and recovering a random DFA from uniform input strings and state information in the statistical query model. A random DFA is uniformly generated: for each state-symbol pair (q ∈ Q, σ ∈ Σ), we choose a state q ∈ Q with replacement uniformly and independently at random and let ϕ(q, σ) = q , where Q is the state space, Σ is the alphabet and ϕ is the transition function. The given data are stringstate pairs (x, q) where x is a string drawn uniformly at random and q is the state of the DFA reached on input x starting from the start state q0. A theoretical guarantee on the maximum absolute error of the algorithm in the st...

Added |
15 Apr 2016 |

Updated |
15 Apr 2016 |

Type |
Journal |

Year |
2015 |

Where |
ALT |

Authors |
Dana Angluin, Dongqu Chen |

Comments (0)