Add to ORKGInternational audienceThis paper presents an efficient random generator, based on a Boltzmann sampler, for accessible, deterministic and possibly not complete automata
Partially ordered automata are finite automata admitting no simple loops of length greater than or e...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
The original publication is a available at www.springerlink.comInternational audienceUniform random ...
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...
International audienceWe present a bijection between the set A_n of deterministic and accessible aut...
International audienceIn this article we propose an algorithm, based on Markov chain techniques, to ...
AbstractWe present a bijection between the set An of deterministic and accessible automata with n st...
International audienceWe present a bijection between the set $\mathcal{A}_n$ of deterministic and ac...
International audienceThis paper presents a library devoted to the random and exhaustive generation ...
International audienceWe study the distribution of the number of accessible states in deterministic ...
International audienceIn this article, we propose a uniform random generator for accessible determin...
International audienceThis papers presents a general framework for the uniform random generation of ...
Partially ordered automata are finite automata admitting no simple loops of length greater than or e...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
The original publication is a available at www.springerlink.comInternational audienceUniform random ...
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...
International audienceWe present a bijection between the set A_n of deterministic and accessible aut...
International audienceIn this article we propose an algorithm, based on Markov chain techniques, to ...
AbstractWe present a bijection between the set An of deterministic and accessible automata with n st...
International audienceWe present a bijection between the set $\mathcal{A}_n$ of deterministic and ac...
International audienceThis paper presents a library devoted to the random and exhaustive generation ...
International audienceWe study the distribution of the number of accessible states in deterministic ...
International audienceIn this article, we propose a uniform random generator for accessible determin...
International audienceThis papers presents a general framework for the uniform random generation of ...
Partially ordered automata are finite automata admitting no simple loops of length greater than or e...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
The original publication is a available at www.springerlink.comInternational audienceUniform random ...