A Universal Kernel for Learning Regular Languages

Simple item page
dc.creatorLeonid
dc.creatorKontorovich
dc.date2007-12-05
dc.date.accessioned2026-07-07T08:47:36Z
dc.date.available2026-07-07T08:47:36Z
dc.descriptionWe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0712.0840
dc.identifierhttp://arxiv.org/abs/0712.0840
dc.identifierThe 5th International Workshop on Mining and Learning with Graphs, 2007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143657
dc.subjectMachine Learning
dc.subjectDiscrete Mathematics
dc.subjectF.1.1; D.3.1; F.4.3
dc.titleA Universal Kernel for Learning Regular Languages
dc.typetext

Files

Collections

arXiv