Boltzmann generation for regular languages with shuffle
Résumé
This paper is devoted to uniform generation of words produced by regular specifications containing shuffle operators. We provide a Boltzmann sampler with complexity linear in the size of the output, where complexity is measured in the number of real-arithmetic operations and evaluations of generating functions.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...