Pages that link to "Item:Q1334679"
From MaRDI portal
The following pages link to On a conjecture about slender context-free languages (Q1334679):
Displaying 19 items.
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- Slender Siromoney matrix languages (Q948096) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- Slender 0L languages (Q1351458) (← links)
- Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
- Length considerations in context-free languages (Q1391135) (← links)
- On strongly context-free languages (Q1570831) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- Min of Mat is not necessarily Mat (Q1606988) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- RESULTS CONCERNING THINNESS OF D0L LANGUAGES (Q4786244) (← 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)
- (Q5061518) (← links)
- On Parikh slender context-free languages (Q5941095) (← links)
- One-dimensional pattern generation by cellular automata (Q6137186) (← links)
