Biased Boltzmann samplers and generation of extended linear languages with shuffle
This paper is devoted to the construction of Boltzmann samplers according to various distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce a sampler with a different distribution for the size of the output. As a significant application, we produce Boltzmann samp...
Uloženo v:
| Vydáno v: | Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AQ,...; číslo Proceedings; s. 125 - 140 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
DMTCS
01.01.2012
Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science |
| Edice: | DMTCS Proceedings |
| Témata: | |
| ISSN: | 1365-8050, 1462-7264, 1365-8050 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This paper is devoted to the construction of Boltzmann samplers according to various distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce a sampler with a different distribution for the size of the output. As a significant application, we produce Boltzmann samplers for words defined by regular specifications containing shuffle operators and linear recursions. This sampler has linear complexity in the size of the output, where the complexity is measured in terms of real-arithmetic operations and evaluations of generating functions. |
|---|---|
| ISSN: | 1365-8050 1462-7264 1365-8050 |
| DOI: | 10.46298/dmtcs.2989 |