Math 2.0

Computer science Definition

Dyck word

Definition

A Dyck word is a finite word ww over the two-letter alphabet {U,D}\{U, D\} with these two properties. The word ww has as many letters UU as letters DD. Each prefix of ww has at least as many letters UU as letters DD.

The semilength of a Dyck word is its number of letters UU, which is half its length.

Remarks

Other common alphabets are {(,)}\{(, )\} and {[,]}\{[, ]\}. Then the Dyck words are the balanced strings of brackets. The Dyck words of semilength 22 are UUDDUUDD and UDUDUDUD. Read UU as a step (1,1)(1, 1) and DD as a step (1,−1)(1, -1). A Dyck word is then a lattice path from (0,0)(0, 0) to (2n,0)(2n, 0) that never goes below the horizontal axis. The Dyck words of semilength nn are counted by the Catalan number CnC_n.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Dyck_language, Formal definition
About this page
Tag0R9JR0465V
URIm2://0R9JR0465V
Kinddefinition
WritingW0 stub
MSC68Q45
DefinesDyck word

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by