A Universal Kernel for Learning Regular Languages

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-91253

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.