Sciweavers

762 search results - page 4 / 153
» Intercode Regular Languages
Sort
View
DLT
2009
13 years 5 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
FOSSACS
2011
Springer
12 years 11 months ago
Regularity and Context-Freeness over Word Rewriting Systems
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...
Didier Caucal, Dinh Trong Hieu
JMLR
2012
11 years 9 months ago
Lifted coordinate descent for learning with trace-norm regularization
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...
Miroslav Dudík, Zaïd Harchaoui, J&eacu...
ATVA
2009
Springer
146views Hardware» more  ATVA 2009»
13 years 11 months ago
Specification Languages for Stutter-Invariant Regular Properties
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...
Christian Dax, Felix Klaedtke, Stefan Leue
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 2 months ago
Linear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
Mircea Marin, Temur Kutsia