论文信息 - Boltzmann generation for regular languages with shuffle

Boltzmann generation for regular languages with shuffle

This paper is devoted to uniform generation of words produced by regular speciﬁcations 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.

Olivier Roussel | K. Panagiotou | Alexis Darrasse | M. Soria

[1] Philippe Flajolet,et al. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[2] Gilbert Labelle,et al. Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.

[3] Alain Denise,et al. Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic , 1999, Theor. Comput. Sci..

[4] Guy Louchard,et al. Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[5] Alain Denise,et al. Uniform random sampling of traces in very large models , 2006, RT '06.

[6] P. Flajolet,et al. Boltzmann Sampling of Unlabelled Structures , 2006 .

[7] Mike Zabrocki,et al. Analytic aspects of the shuffle product , 2008, STACS.

[8] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .