Abstract
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).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Alonso, L., Schott, R. (1995). A Parallel Algorithm for the Generation of Words. In: Random Generation of Trees. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6353-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6353-9_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5150-2
Online ISBN: 978-1-4757-6353-9
eBook Packages: Springer Book Archive