On a conjecture about slender context-free languages
From MaRDI portal
Publication:1334679
DOI10.1016/0304-3975(94)00042-5zbMath0938.68707OpenAlexW2000494418WikidataQ123286018 ScholiaQ123286018MaRDI QIDQ1334679
Publication date: 25 September 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00042-5
Related Items (19)
RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ Periodic and Sturmian languages ⋮ Slender 0L languages ⋮ On differentiation functions, structure functions, and related languages of context-free grammars ⋮ Language-theoretic complexity of disjunctive sequences ⋮ Length considerations in context-free languages ⋮ Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508 ⋮ On counting functions and slenderness of languages ⋮ One-dimensional pattern generation by cellular automata ⋮ A decision method for Parikh slenderness of context-free languages ⋮ Slender Siromoney matrix languages ⋮ Unnamed Item ⋮ On the structure of the counting function of sparse context-free languages. ⋮ On Parikh slender context-free languages ⋮ Decimations of languages and state complexity ⋮ On strongly context-free languages ⋮ On lengths of words in context-free languages ⋮ A characterization of poly-slender context-free languages ⋮ Min of Mat is not necessarily Mat
Cites Work
This page was built for publication: On a conjecture about slender context-free languages
