Computer Science – Learning
Scientific paper
2007-12-05
The 5th International Workshop on Mining and Learning with Graphs, 2007
Computer Science
Learning
7 pages
Scientific paper
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.
Kontorovich
Leonid
No associations
LandOfFree
A Universal Kernel for Learning Regular Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Universal Kernel for Learning Regular Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Universal Kernel for Learning Regular Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-91253