<commit_before>homepage: https://github.com/johanneshilden/dyckword#readme
changelog-type: ''
hash: d27c082969eec1c0fe7b0b07113152364c73eb0230554ecc37a963e5e675d35b
test-bench-deps:
  base: -any
  hspec: -any
  text: -any
  dyckword: -any
  ansi-terminal: -any
maintainer: <EMAIL>
synopsis: A library for working with binary Dyck words.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  text: -any
  exact-combinatorics: -any
all-versions:
- '0.1.0.1'
- '0.1.0.2'
author: <NAME>
latest: '0.1.0.2'
description-type: markdown
description: ! '# dyckword


  In formal language theory, the *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 (named after German mathematician Walther
  von Dyck) are known as *Dyck words*, some examples of which are `()()()`, `(())((()))`,
  and `((()()))()`.


  The type of Dyck language considered here is defined over a binary alphabet. We
  will take this alphabet to be the set Σ = {(, )} in the following examples. The
  binary Dyck language is the subset of Σ* (the Kleene closure of Σ) of all words
  that satisfy two conditions:


  1. The number of left brackets must be the same as the number of right brackets.

  2. Going from left to right, for each character read, the total number of right
  brackets visited must be less than or equal to the number of left brackets up to
  the current position.


  E.g., `(()(()` and `())(())()` are **not** Dyck words.


  When regarded as a combinatorial class &ndash; with the size of a word defined as
  the number of bracket pairs it contains &ndash; the counting sequence associated
  with the Dyck language is the *Catalan numbers*.

'
license-name: BSD3<commit_msg>Update from Hackage at 2017-05-01T09:29:40Z<commit_after>homepage: https://github.com/johanneshilden/dyckword#readme
changelog-type: ''
hash: 9554239b66946f79b967bf63d6081298026440633214b516acd485b822c6d40c
test-bench-deps:
  base: -any
  hspec: -any
  text: -any
  dyckword: -any
  ansi-terminal: -any
maintainer: <EMAIL>
synopsis: A library for working with binary Dyck words.
changelog: ''
basic-deps:
  base: ==4.*
  text: -any
  exact-combinatorics: -any
all-versions:
- '0.1.0.1'
- '0.1.0.2'
- '0.1.0.3'
author: <NAME>
latest: '0.1.0.3'
description-type: markdown
description: ! '# dyckword [![Build Status](https://img.shields.io/travis/johanneshilden/dyckword/master.svg?style=flat)](https://travis-ci.org/johanneshilden/dyckword)


  In formal language theory, the *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 (named after German mathematician Walther
  von Dyck) are known as *Dyck words*, some examples of which are `()()()`, `(())((()))`,
  and `((()()))()`.


  The type of Dyck language considered here is defined over a binary alphabet. We
  will take this alphabet to be the set Σ = {(, )} in the following examples. The
  binary Dyck language is the subset of Σ* (the Kleene closure of Σ) of all words
  that satisfy two conditions:


  1. The number of left brackets must be the same as the number of right brackets.

  2. Going from left to right, for each character read, the total number of right
  brackets visited must be less than or equal to the number of left brackets up to
  the current position.


  E.g., `(()(()` and `())(())()` are **not** Dyck words.


  When regarded as a combinatorial class &ndash; with the size of a word defined as
  the number of bracket pairs it contains &ndash; the counting sequence associated
  with the Dyck language is the *Catalan numbers*.


'
license-name: BSD3
{'fraction_non_alphanumeric': 0.10921228304405875, 'fraction_numerical': 0.03871829105473965, 'mean_word_length': 3.981382978723404, 'pattern_counts': {'":': 0, '<': 8, '<?xml version=': 0, '>': 8, 'https://': 4, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 7, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1042786', 'n_tokens_mistral': 1345, 'n_tokens_neox': 1204, 'n_words': 481}