Dyck Language

The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy

1. |u|_x=|u|_(x^_), where |u|_x is the numbers of letters x in the word u, and

2. if u is factored as vw, where v and w are words of X^*, then |v|_x>=|v|_(x^_).

See also

Algebraic Language

Explore with Wolfram|Alpha


Bousquet-Mélou, M. "Convex Polyominoes and Heaps of Segments." J. Phys. A: Math. Gen. 25, 1925-1934, 1992.

Referenced on Wolfram|Alpha

Dyck Language

Cite this as:

Weisstein, Eric W. "Dyck Language." From MathWorld--A Wolfram Web Resource.

Subject classifications