Language-theoretic problems arising from Richelieu cryptosystems

DOI10.1016/0304-3975(93)90327-PzbMath0797.68094OpenAlexW2082641615MaRDI 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)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90327-p

zbMATH Keywords

decidabilityformal languagesgarbage-in-between cryptosystemsRichelieu cryptosystems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Related Items

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

Cites Work

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