published by Leonid (Aryeh) Kontorovich
in 2007
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.