ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
From MaRDI portal
Publication:5053733
DOI10.1142/9789812810908_0015zbMATH Open1499.68180OpenAlexW114247093MaRDI QIDQ5053733FDOQ5053733
Authors: Lucian Ilie 
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
Recommendations
- A characterization of poly-slender context-free languages
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- A decision method for Parikh slenderness of context-free languages
- On lengths of words in context-free languages
- On Parikh slender context-free languages
Cited In (10)
- On slender context-free languages
- Title not available (Why is that?)
- Closure properties of slender languages
- Title not available (Why is that?)
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- Recognition of poly-slender context-free languages by trellis automata
- A characterization of poly-slender context-free languages
- On the structure of the counting function of sparse context-free languages.
- On bounded linear codes and the commutative equivalence
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053733)
