✦ LIBER ✦

Unrestricted complementation in language equations over a one-letter alphabet

✍ Scribed by E.L. Leiss

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 986 KB
Volume: 132
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90227-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of the dyck-language

On a generalization of the dyck-language over a two letter alphabet

✍ Helmut Prodinger 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Some properties of the language {w E (a, b}\* 1 d;) = (g)}, which can be regarded as a generalization of the (unrestricted) Dyck-language, are given. (Q are the binomial coefficients for words.)