Non-redundant random generation algorithms for weighted context-free languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2013

Non-redundant random generation algorithms for weighted context-free languages

Abstract

We address the non-redundant random generation of $k$ words of length $n$ in a context-free language. Additionally, we want to avoid a predefined set of words. We study a rejection-based approach, whose worst-case time complexity is shown to grow exponentially with $k$ for some specifications and in the limit case of a coupon collector. We propose two algorithms respectively based on the recursive method and on an unranking approach. We show how careful implementations of these algorithms allow for a non-redundant generation of $k$ words of length $n$ in $\mathcal{O}(k\cdot n\cdot \log{n})$ arithmetic operations, after a precomputation of $\Theta(n)$ numbers. The overall complexity is therefore dominated by the generation of $k$ words, and the non-redundancy comes at a negligible cost.
Fichier principal
Vignette du fichier
NonRedundantGeneration-TCS-2010.pdf (603.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00607745 , version 1 (11-07-2011)
inria-00607745 , version 2 (01-11-2012)

Identifiers

Cite

Andy Lorenz, Yann Ponty. Non-redundant random generation algorithms for weighted context-free languages. Theoretical Computer Science, 2013, Generation of Combinatorial Structures, 502, pp.177-194. ⟨10.1016/j.tcs.2013.01.006⟩. ⟨inria-00607745v2⟩
351 View
379 Download

Altmetric

Share

Gmail Facebook X LinkedIn More