759 search results - page 65 / 152 » Overlap-Free Regular Languages |
NIPS
2004
14 years 11 months ago
2004
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
DAM
2007
14 years 9 months ago
2007
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...
108
click to vote
TCS
2008
14 years 9 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decid...
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...