Noun
(plural Dyck words)
- (mathematics, combinatorics) A string consisting of n X's and n Y's such that no initial segment of the string has more Y's than X's.
