22 search results - page 2 / 5 » Prime Decompositions of Regular Languages |
WIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
106
click to vote
FOSSACS
2011
Springer
14 years 4 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
139
click to vote
JMLR
2012
13 years 3 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...
162
click to vote
LATA
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
133
click to vote
DLT
2009
14 years 10 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1