On a generalization of the Dyck-language over a two letter alphabet
From MaRDI portal
Publication:1131843
DOI10.1016/0012-365X(79)90134-1zbMath0418.68064OpenAlexW2007799867MaRDI QIDQ1131843
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(79)90134-1
formal languagescontext-free languagessyntactic monoidstructure generating functionDyck setsgeneralized binomial coefficient
Factorials, binomial coefficients, combinatorial functions (05A10) Formal languages and automata (68Q45)
Related Items (5)
Balanced-by-construction regular and \(\omega \)-regular languages ⋮ Balanced-by-Construction Regular and ω-Regular Languages ⋮ Resolution of T. Ward's Question and the Israel–Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics ⋮ ON SUBWORD SYMMETRY OF WORDS ⋮ On the interpolation of DOL-sequences
Cites Work
This page was built for publication: On a generalization of the Dyck-language over a two letter alphabet