A Universal Kernel for Learning Regular Languages
classification
💻 cs.LG
cs.DM
keywords
kernellanguagesregularuniversalableapproximationcomputeconjecture
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.