It is well-known that every monoidal category is equivalent to a strict one. We show that for categories of sets with additional structure (which we define quite formally below) it is not even necessary to change the category: The same category has a different (but isomorphic) tensor product, with which it is a strict monoidal category. The result applies to ordinary (bi)modules, where it shows...

Many theories have been proposed for answering two questions on aging: “Why do we age?” and “How do we age?” Among them, evolutionary theories are made for interpreting the evolutionary advantage of aging, and “saving resources for group benefit” is thought to be the purpose of aging. However for saving resources, a more economic strategy should be to make the individuals over reproduction age ...

The purpose of this note is to summarize recent results [6, 4, 5] on stochastic games by the author and his collaborators. These results have appeared or will appear in proceedings of computer science conferences. The intended reader of this note has an interest in finite stochastic games, but no particular interest in computation, that is, the computational aspects of the results obtained have...

A parameterized problem consists of a classical problem and an additional component, the so-called parameter. This point of view allows a formal definition of preprocessing: Given a parameterized instance (I, k), a polynomial kernelization computes an equivalent instance (I , k) of size and parameter bounded by a polynomial in k. We give a complete classification of Min Ones Constraint Satisfac...

We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language L, find a maximal independent language containing L. We consider the case where the code-related property is defined via a rational binary relation that is decreasing with respect to any fixed total order on the set of words. Our method works by iterating a max-min ope...