A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Random generation of words in an algebraic language in linear binary space
Information Processing Letters
On the Solution of Linear Recurrence Equations
Computational Optimization and Applications
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Introduction to algorithms
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
| Hi-index | 5.23 |
We present a new algorithm for generating uniformly at random words of any regular language L. When using floating point arithmetics, its bit-complexity is O(qlg^2n) in space and O(qnlg^2n) in time, where n stands for the length of the word, and q stands for the number of states of a finite deterministic automaton of L. We implemented the algorithm and compared its behavior to the state-of-the-art algorithms, on a set of large automata from the VLTS benchmark suite. Both theoretical and experimental results show that our algorithm offers an excellent compromise in terms of space and time requirements, compared to the known best alternatives. In particular, it is the only method that can generate long paths in large automata.