Modelling the dynamical behaviour of computer systems
Models of learning and the polar decomposition of bounded linear operators.
Modern view on Kantorovich's work in software.
Modifications de nombres normaux par des transducteurs
Monad compositions. I: General constructions and recursive distributive laws.
Monoid presentations of groups by finite special string-rewriting systems
We show that the class of groups which have monoid presentations by means of finite special -confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group.
Monoid presentations of groups by finite special string-rewriting systems
We show that the class of groups which have monoid presentations by means of finite special [λ]-confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group.
Monoïde libre et musique : deuxième partie
Monoïde libre et musique, première partie : les musiciens ont-ils besoin des mathématiques ?
Monoides pointes.
Monoïdes syntactiques et familles de langages rationnels
Monotone (co)inductive types and positive fixed-point types
Monotone (co)inductive types and positive fixed-point types
We study five extensions of the polymorphically typed lambda-calculus (system F) by type constructs intended to model fixed-points of monotone operators. Building on work by Geuvers concerning the relation between term rewrite systems for least pre-fixed-points and greatest post-fixed-points of positive type schemes (i.e., non-nested positive inductive and coinductive types) and so-called retract types, we show that there are reduction-preserving embeddings even between systems of monotone (co)inductive...
Monotonous and randomized reductions to sparse sets
MOP -- algorithmic modality analysis for parabolic actions.
More about the closure of NP
More on the complexity of cover graphs
In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.
Morphic and automatic words: maximal blocks and Diophantine approximation
Morphing planar graphs in spherical space.
Morphismes sturmiens et règles de Rauzy
Nous donnons une caractérisation complète de tous les morphismes binaires qui préservent les mots sturmiens et montrons que les mots infinis engendrés par ces morphismes sont rigides.