759 search results - page 17 / 152 » Overlap-Free Regular Languages |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
JMLR
2012
11 years 11 months ago
2012
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
JUCS
2002
13 years 8 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
INFORMATICALT
2000
13 years 8 months ago
2000
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
JUCS
2010
13 years 6 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...