Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm
暂无分享,去创建一个
[1] Enrique Vidal,et al. Identification of DFA: data-dependent vs data-independent algorithms , 1996, ICGI.
[2] Ronitt Rubinfeld,et al. Efficient learning of typical finite automata from random walks , 1993, STOC.
[3] Boris A. Trakhtenbrot,et al. Finite automata : behavior and synthesis , 1973 .
[4] L. P. J. Veelenturf,et al. Inference of Sequential Machines from Sample Computations , 1978, IEEE Transactions on Computers.
[5] J. Oncina,et al. INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME , 1992 .
[6] Leslie G. Valiant,et al. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.
[7] Enrique Vidal,et al. What Is the Search Space of the Regular Inference? , 1994, ICGI.
[8] DANA ANGLUIN,et al. On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..
[9] Kevin J. Lang. Random DFA's can be approximately learned from sparse uniform examples , 1992, COLT '92.
[10] Joe Kilian,et al. A Scheme for Secure Pass-Fail Tests , 1997 .