scientific article; zbMATH DE number 938665

zbMATH Open0861.68026MaRDI QIDQ4896950FDOQ4896950

Authors: Erkki Mäkinen 

Publication date: 27 October 1996

Title of this publication is not available (Why is that?)

Recommendations

• \((0,1)\)-total pure context-free grammars
• An undecidable problem for context-free grammars
• Undecidable problems concerning densities of languages
• scientific article; zbMATH DE number 871232
• An undecidable property of context-free linear orders

zbMATH Keywords

cryptosystemsSzilard language

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cited In (3)

• There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
• \((0,1)\)-total pure context-free grammars
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896950)