51 citations
- Université Paris CitéFR20 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Institut national de recherche en sciences et technologies du numériqueFR5 papers
- École Normale Supérieure de LyonFR3 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- Laboratoire de l'Informatique du ParallélismeFR2 papers
- Orange (France)FR2 papers
- Center for Mathematical ModelingCL1 paper
- Computer Algorithms for MedicineAT1 paper
- Délégation Paris 7FR1 paper
- École Normale Supérieure - PSLFR1 paper
- Group Sense (China)CN1 paper
6 papers · 1 filter
Series which are both max-plus and min-plus rational are unambiguous
Sylvain Lombardy, Jean Mairesse
Consider partial maps from the free monoid into the field of real numbers with a rational domain. We show that two families of such series are actually the same: the unambiguous ra…
Services within a busy period of an M/M/1 queue and Dyck paths
Moez Draief, Jean Mairesse
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b…
Zero-automatic queues and product form
Thu-Ha Dao-Thi, Jean Mairesse
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite…
Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority
Damien Regnault, Nicolas Schabanel, Éric Thierry
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the…
Abstract numeration systems on bounded languages and multiplication by a constant
Emilie Charlier, Michel Rigo, Wolfgang Steiner
A set of integers is -recognizable in an abstract numeration system if the language made up of the representations of its elements is accepted by a finite automaton. For abs…
On restrictions of balanced 2-interval graphs
Philippe Gambette, Stéphane Vialette
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applicatio…