A Parallel Algorithm for the Generation of Words
A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log 2(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck, Motzkin words and words of the language ε (see Chapter 5).
Unable to display preview. Download preview PDF.