论文信息 - Algorithms for Learning Finite Automata from Queries: A Unified View

Algorithms for Learning Finite Automata from Queries: A Unified View

In this survey we compare several known variants of the algorithm for learning deterministic finite automata via membership and equivalence queries. We believe that our presentation makes it easier to understand what is going on and what the differences between the various algorithms mean. We also include the comparative analysis of the algorithms, review some known lower bounds, prove a new one, and discuss the question of parallelizing this sort of algorithm.

[1] Yoshiyasu Ishigami,et al. The VC-Dimensions of Finite Automata with n States , 1993, ALT.

[2] Nader H. Bshouty,et al. On the exact learning of formulas in parallel , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[3] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .

[4] Robert E. Schapire,et al. Design and analysis of efficient learning algorithms , 1992, ACM Doctoral dissertation award ; 1991.

[5] Nader H. Bshouty,et al. Asking questions to minimize errors , 1993, COLT '93.

[6] Osamu Watanabe,et al. An optimal parallel algorithm for learning DFA , 1994, COLT '94.

[7] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[8] José L. Balcázar,et al. On Bounded Query Machines , 1985, Theor. Comput. Sci..

[9] D. Angluin. Queries and Concept Learning , 1988 .

[10] Leonard Pitt,et al. Inductive Inference, DFAs, and Computational Complexity , 1989, AII.

[11] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.