759 search results - page 3 / 152 » Odometers on Regular Languages |
172
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
146
Voted
SOFSEM
2012
Springer
13 years 11 months ago
2012
Springer
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
130
click to vote
FOSSACS
2011
Springer
14 years 7 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...
168
Voted
JMLR
2012
13 years 6 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...
122
Voted
ATVA
2009
Springer
15 years 8 months ago
2009
Springer
We present specification languages that naturally capture exactly the regular and -regular properties that are stutter invariant. Our specification languages are variants of the cl...