Pages that link to "Item:Q1391135"

The following pages link to Length considerations in context-free languages (Q1391135):

Displaying 16 items.

• A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
• Slender Siromoney matrix languages (Q948096) (← links)
• The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
• Slender 0L languages (Q1351458) (← links)
• Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
• On lengths of words in context-free languages (Q1575557) (← links)
• Min of Mat is not necessarily Mat (Q1606988) (← links)
• On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
• Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
• FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
• A characterization of poly-slender context-free languages (Q4494483) (← links)
• The monoids of the patience sorting algorithm (Q4629511) (← links)
• On differentiation functions, structure functions, and related languages of context-free grammars (Q4825398) (← links)
• 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 (Q4923560) (← links)
• Contexts on trajectories (Q4935387) (← links)
• On Parikh slender context-free languages (Q5941095) (← links)