论文信息 - A Universal Kernel for Learning Regular Languages

A Universal Kernel for Learning Regular Languages

We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but we do have an efficient $\eps$-approximation.

Aryeh Kontorovich

[1] Mehryar Mohri,et al. Learning Languages with Rational Kernels , 2007, COLT.

[2] Mehryar Mohri,et al. Learning Linearly Separable Languages , 2006, ALT.

[3] Leonard Pitt,et al. The minimum consistent DFA problem cannot be approximated within any polynomial , 1993, JACM.

[4] E. Mark Gold,et al. Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

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

[6] Alexander J. Smola,et al. Learning with kernels , 1998 .

[7] DANA ANGLUIN,et al. On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..