Multi-dimensional Boltzmann Sampling of context-free Languages

@article{Bodini2010MultidimensionalBS,
  title={Multi-dimensional Boltzmann Sampling of context-free Languages},
  author={Olivier Bodini and Yann Ponty},
  journal={ArXiv},
  year={2010},
  volume={abs/1002.0046}
}
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 an extended -- multidimensional -- version of the classic 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… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.

Polynomial tuning of multiparametric combinatorial samplers

VIEW 4 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

A calculus for the random generation of labelled combinatorial structures

Philippe Flajolet, Paul Zimmerman, Bernard Van Cutsem
  • Theoretical Computer Science
  • 1994
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Holonomic power series and their applications to languages, Ph.D. thesis, Facoltà di scienze matematiche, fisiche et naturali

Roberto Radicioni
  • Università degli studi di Milano,
  • 2006
VIEW 1 EXCERPT

Random generations of words in regular languages with fixed occurrences of symbols

A. Bertoni, P. Massazza, R. Radicioni
  • Proceedings of Words’03,
  • 2003
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…