Language-theoretic problems arising from Richelieu cryptosystems

DOI10.1016/0304-3975(93)90327-PzbMath0797.68094MaRDI QIDQ685369

Arto Salomaa, Gheorghe Păun, Mircea Andraşiu, Juergen Dassow

Publication date: 19 October 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidability; formal languages; garbage-in-between cryptosystems; Richelieu cryptosystems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A60: Cryptography

Related Items

A characterization of poly-slender context-free languages, RESULTS CONCERNING THINNESS OF D0L LANGUAGES, Numeration systems, linear recurrences, and regular sets, On Parikh slender context-free languages, A decision method for Parikh slenderness of context-free languages, Slender Siromoney matrix 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, Closure properties of slender languages, On a conjecture about slender context-free languages, Slender 0L languages, Language-theoretic complexity of disjunctive sequences, Length considerations in context-free languages, On lengths of words in context-free languages, Min of Mat is not necessarily Mat, Another variation on Conway's recursive sequence, Thin and slender languages, Intertwined infinite binary words, State Complexity of Insertion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item