On a generalization of the Dyck language over a two letter alphabet

Abstract. Some properties of the language {w\in {a,b}^* | \binom{w}{ab}=\binom{w}{ba} }, which can be regarded as a generalization of the (unrestricted) Dyck language, are given. (\binom{x}{y} are the binomial coefficients for words.)

helmut@gauss.cam.wits.ac.za,

Friedrich.Urbanek@tuwien.ac.at,

This paper is not available on this server.

(Back to List of Papers)