ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
From MaRDI portal
Publication:5053733
DOI10.1142/9789812810908_0015zbMath1499.68180OpenAlexW114247093MaRDI QIDQ5053733
Publication date: 6 December 2022
Published in: Words, Semigroups, and Transductions (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789812810908_0015
Related Items (3)
On bounded linear codes and the commutative equivalence ⋮ On the structure of the counting function of sparse context-free languages. ⋮ The Parikh counting functions of sparse context-free languages are quasi-polynomials
This page was built for publication: ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
