Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Characterization of Glushkov automata
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Generating connected acyclic digraphs uniformly at random
Information Processing Letters
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Theoretical Computer Science - Descriptional complexity of formal systems
Enumeration and random generation of accessible automata
Theoretical Computer Science
Small Extended Expressions for Acyclic Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Exact enumeration of acyclic deterministic automata
Discrete Applied Mathematics
Acyclic automata and small expressions using multi-tilde-bar operators
Theoretical Computer Science
Parametric random generation of deterministic tree automata
Theoretical Computer Science
| Hi-index | 5.23 |
We propose algorithms that use Markov chain techniques to generate acyclic automata uniformly at random. We first consider deterministic, accessible and acyclic automata, then focus on the class of minimal acyclic automata. In each case we explain how to define random local transformations that describe an ergodic and symmetric Markov chain; the distribution of the automaton obtained after T random steps in this Markov chain tends to the uniform distribution as T tends to infinity.