Boltzmann generation for regular languages with shuffle

Alexis Darrasse (1) , Konstantinos Panagiotou (2) , Olivier Roussel (1) , Michèle Soria (1)

1 APR - Algorithmes, Programmes et Résolution
2 MPII - Max-Planck-Institut für Informatik

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.

Keywords: Génération aléatoire; Modèle de Boltzmann; Shuffle; Combinatoire; Langage régulier

Domains: Discrete Mathematics [cs.DM]; Computation and Language [cs.CL]; Data Structures and Algorithms [cs.DS]

Alexis Darrasse, Konstantinos Panagiotou, Olivier Roussel, Michèle Soria. Boltzmann generation for regular languages with shuffle. GASCOM 2010 - Conference on random generation of combinatorial structures, Sep 2010, Montréal, Canada. ⟨hal-00548898⟩