Pages that link to "Item:Q685369"
From MaRDI portal
The following pages link to Language-theoretic problems arising from Richelieu cryptosystems (Q685369):
Displaying 19 items.
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- Slender Siromoney matrix languages (Q948096) (← links)
- Closure properties of slender languages (Q1314376) (← links)
- On a conjecture about slender context-free languages (Q1334679) (← links)
- Slender 0L languages (Q1351458) (← links)
- Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
- Length considerations in context-free languages (Q1391135) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- Min of Mat is not necessarily Mat (Q1606988) (← links)
- Another variation on Conway's recursive sequence (Q1827740) (← links)
- Thin and slender languages (Q1897353) (← links)
- Intertwined infinite binary words (Q1917306) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- RESULTS CONCERNING THINNESS OF D0L LANGUAGES (Q4786244) (← 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)
- Insertion and deletion of words: Determinism and reversibility (Q5096843) (← links)
- Numeration systems, linear recurrences, and regular sets (Q5204309) (← links)
- On Parikh slender context-free languages (Q5941095) (← links)
