dyckword: A library for working with binary Dyck words.
The binary Dyck language consists of all strings of evenly balanced left
and right parentheses, brackets, or some other symbols, together with the
empty word. Words in this language are known as Dyck words, some
examples of which are
The counting sequence associated with the Dyck language is the Catalan numbers, who describe properties of a great number of combinatorial objects.
[Skip to Readme]
|Versions [RSS]||0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4|
|Dependencies||base (>=4 && <5), exact-combinatorics, text [details]|
|Copyright||2017 Johannes Hildén|
|Source repo||head: git clone https://github.com/johanneshilden/dyckword|
|Uploaded||by arbelos at 2017-05-01T09:24:13Z|
|Downloads||2785 total (4 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2017-05-01 [all 1 reports]