Sunday, July 11, 2010

Parentesys, Dyck words and strings

A string S can contain just two symbols X and Y. The number of X symbols in S must be equal to the number of Y symbols. For each prefix of S, the number of X must be less than the number of Y.

What is the intepretation of the problem?

1 comment: