On a generalization of the Dyck-language over a two letter alphabet
From MaRDI portal
Publication:1131843
DOI10.1016/0012-365X(79)90134-1zbMath0418.68064MaRDI 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 languages; context-free languages; syntactic monoid; structure generating function; Dyck sets; generalized binomial coefficient
05A10: Factorials, binomial coefficients, combinatorial functions
68Q45: Formal languages and automata
Related Items
Resolution of T. Ward's Question and the Israel–Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics, Balanced-by-Construction Regular and ω-Regular Languages, Balanced-by-construction regular and \(\omega \)-regular languages, On the interpolation of DOL-sequences, ON SUBWORD SYMMETRY OF WORDS
Cites Work