A new dichotomic algorithm for the uniform random generation of words in regular languages (journal version) - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2013

A new dichotomic algorithm for the uniform random generation of words in regular languages (journal version)

Abstract

We present a new algorithm for generating uniformly at random words of any regular language $\mathcal{L}$. When using floating point arithmetics, its bit-complexity is $\mathcal{O}(q \log^2 n)$ in space and $\mathcal{O}(q n \log^2 n)$ 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 $\mathcal{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.
Fichier principal
Vignette du fichier
main.pdf (399.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00716558 , version 1 (10-07-2012)

Identifiers

  • HAL Id : hal-00716558 , version 1

Cite

Johan Oudinet, Alain Denise, Marie-Claude Gaudel. A new dichotomic algorithm for the uniform random generation of words in regular languages (journal version). Theoretical Computer Science, 2013, 502, pp.165-176. ⟨hal-00716558⟩
444 View
204 Download

Share

Gmail Facebook X LinkedIn More