Non-redundant random generation from weighted context-free languages

Details Non-redundant random generation from weighted context-free languages Non-redundant random generation from weighted context-free languages

2010-12-21

arxiv.org/abs/1012.4560v1

Computer Science

Data Structures and Algorithms

Scientific paper

We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of a rejection-based approach, whose time complexity is shown to grow exponentially in k in some cases. We propose an alternative recursive algorithm, whose careful implementation allows for a non-redundant generation of k words of size n in O(kn log n) arithmetic operations after the precomputation of O(n) numbers. The overall complexity is therefore dominated by the generation of k words, and the non-redundancy comes at a negligible cost.

Affiliated with

Also associated with

No associations

Rating

Non-redundant random generation from weighted context-free 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 Non-redundant random generation from weighted context-free languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-redundant random generation from weighted context-free languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95279