A Universal Kernel for Learning Regular Languages
Leonid, Kontorovich · arXiv (Cornell University) · 2007
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.