International audienceThis paper presents a library devoted to the random and exhaustive generation of finite deterministic automata. This package provides a toolkit to experimentally study properties of automata, average complexities of algorithms dealing with automata or to compare different implementations of the same algorithm
International audienceUniform random generators deliver a simple empirical means to estimate the ave...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
International audienceIn this article, we consider deterministic automata under the paradigm of aver...
International audienceThis paper presents a library devoted to the random and exhaustive generation ...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
Abstract. We show that the standard methods for the random generation of finite automata are inadequ...
I, the undersigned, hereby declare that the work contained in this thesis is my own original work an...
International audienceThis papers presents a general framework for the uniform random generation of ...
Le concept d’automate, central en théorie des langages, est l’outil d’appréhension naturel et effica...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
The concept of automata, central to language theory, is the natural and efficient tool to apprehendv...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
International audienceIn this article we propose an algorithm, based on Markov chain techniques, to ...
International audienceUniform random generators deliver a simple empirical means to estimate the ave...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
International audienceIn this article, we consider deterministic automata under the paradigm of aver...
International audienceThis paper presents a library devoted to the random and exhaustive generation ...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
Abstract. We show that the standard methods for the random generation of finite automata are inadequ...
I, the undersigned, hereby declare that the work contained in this thesis is my own original work an...
International audienceThis papers presents a general framework for the uniform random generation of ...
Le concept d’automate, central en théorie des langages, est l’outil d’appréhension naturel et effica...
International audienceThis paper presents an efficient random generator, based on a Boltzmann sample...
The concept of automata, central to language theory, is the natural and efficient tool to apprehendv...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
International audienceIn this article we propose an algorithm, based on Markov chain techniques, to ...
International audienceUniform random generators deliver a simple empirical means to estimate the ave...
This thesis is about the uniform random generation of finite automata and the analysisof their state...
International audienceIn this article, we consider deterministic automata under the paradigm of aver...