# 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 `()()()`

, `(())((()))`

, and `((()()))()`

.

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] [faq] | 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4 |
---|---|

Dependencies | base (>=4.7 && <5), exact-combinatorics, text [details] |

License | BSD-3-Clause |

Copyright | 2017 Johannes Hildén |

Author | Johannes Hildén |

Maintainer | johannes@isomorphic.co |

Category | Math |

Home page | https://github.com/johanneshilden/dyckword#readme |

Source repo | head: git clone https://github.com/johanneshilden/dyckword |

Uploaded | by arbelos at 2017-05-01T07:44:31Z |

Distributions | NixOS:0.1.0.4 |

Downloads | 2586 total (5 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2017-05-01 [all 1 reports] |

## Downloads

- dyckword-0.1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)