Multi-dimensional Boltzmann Sampling of Languages

Details Multi-dimensional Boltzmann Sampling of Languages Multi-dimensional Boltzmann Sampling of Languages

2010-01-30

arxiv.org/abs/1002.0046v3

AOFA'10, Vienne : Autriche (2010)

Computer Science

Data Structures and Algorithms

12pp

Scientific paper

This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size $k$), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional extension of Boltzmann samplers \cite{Duchon2004}. We show that, under mostly \emph{strong-connectivity} hypotheses, our samplers return a word of size in $[(1-\varepsilon)n, (1+\varepsilon)n]$ and exact frequency in $\mathcal{O}(n^{1+k/2})$ expected time. Moreover, if we accept tolerance intervals of width in $\Omega(\sqrt{n})$ for the number of occurrences of each letters, our samplers perform an approximate-size generation of words in expected $\mathcal{O}(n)$ time. We illustrate these techniques on the generation of Tetris tessellations with uniform statistics in the different types of tetraminoes.

Affiliated with

Also associated with

No associations

Rating

Multi-dimensional Boltzmann Sampling of Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multi-dimensional Boltzmann Sampling of Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-dimensional Boltzmann Sampling of Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251400