Abstract
We give algorithms to list all well-formed strings of n pairs of parentheses. In the spirit of [211] we use the term paren string for a well-formed string of parentheses. A generalization, the k-ary Dyck words, is described at the end of the section.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Arndt, J. (2011). Parentheses strings. In: Matters Computational. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-14764-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14763-0
Online ISBN: 978-3-642-14764-7
eBook Packages: Computer ScienceComputer Science (R0)