Length considerations in context-free languages
From MaRDI portal
Publication:1391135
DOI10.1016/S0304-3975(96)00308-8zbMath0911.68097MaRDI QIDQ1391135
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
A characterization of poly-slender context-free languages, The monoids of the patience sorting algorithm, On differentiation functions, structure functions, and related languages of context-free grammars, Contexts on trajectories, On Parikh slender context-free languages, A decision method for Parikh slenderness of context-free languages, Slender Siromoney matrix languages, The Parikh counting functions of sparse context-free languages are quasi-polynomials, 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, Slender 0L languages, Language-theoretic complexity of disjunctive sequences, On lengths of words in context-free languages, Min of Mat is not necessarily Mat, On the structure of the counting function of sparse context-free languages., Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time, FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
Cites Work
