Sciweavers

3443 search results - page 168 / 689
» More Algebras for Determiners
Sort
View
ALGORITHMICA
2008
56views more  ALGORITHMICA 2008»
13 years 11 months ago
Eliminating Cycles in the Discrete Torus
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
Béla Bollobás, Guy Kindler, Imre Lea...
ENTCS
2008
120views more  ENTCS 2008»
13 years 10 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 10 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 10 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
ECEASST
2006
96views more  ECEASST 2006»
13 years 10 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau