Add to ORKGInternational audienceThis paper presents an efficient random generator, based on a Boltzmann sampler, for accessible, deterministic and possibly not complete automata
International audienceUniform random generators deliver a simple empirical means to estimate the ave...
We present a bijection between the set An of deterministic and accessible automata with n states on ...
International audienceIn this article, we consider deterministic automata under the paradigm of aver...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
Colloque avec actes et comité de lecture. internationale.International audienceThis note proposes a ...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
This article proposes a surprisingly simple framework for the random generation of combinatorial con...
International audienceIn this article we propose an algorithm, based on Markov chain techniques, to ...
International audienceThis paper presents a library devoted to the random and exhaustive generation ...
Cette thèse porte sur la génération aléatoire uniforme des automates finis et l'analyse des algorith...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
Partially ordered automata are finite automata admitting no simple loops of length greater than or e...
AbstractWe present a bijection between the set An of deterministic and accessible automata with n st...
International audienceUniform random generators deliver a simple empirical means to estimate the ave...
We present a bijection between the set An of deterministic and accessible automata with n states on ...
International audienceIn this article, we consider deterministic automata under the paradigm of aver...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
Colloque avec actes et comité de lecture. internationale.International audienceThis note proposes a ...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
This article proposes a surprisingly simple framework for the random generation of combinatorial con...
International audienceIn this article we propose an algorithm, based on Markov chain techniques, to ...
International audienceThis paper presents a library devoted to the random and exhaustive generation ...
Cette thèse porte sur la génération aléatoire uniforme des automates finis et l'analyse des algorith...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
Partially ordered automata are finite automata admitting no simple loops of length greater than or e...
AbstractWe present a bijection between the set An of deterministic and accessible automata with n st...
International audienceUniform random generators deliver a simple empirical means to estimate the ave...
We present a bijection between the set An of deterministic and accessible automata with n states on ...
International audienceIn this article, we consider deterministic automata under the paradigm of aver...