scientific article; zbMATH DE number 1067868

MaRDI QIDQ4358451zbMATH OpenFDO

Authors Ferucio Laurenţiu Ţiplea, Erkki Mäkinen

Publication date 29 September 1997

zbMATH Keywords

ambiguitycryptosystemspure context-free grammars

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Grammars and rewriting systems (68Q42)

Recommendations

• A note on ambiguity in context-free grammars
• scientific article; zbMATH DE number 3896326
• Analyzing Ambiguity of Context-Free Grammars
• The inherent ambiguity partial algorithm problem for context free languages
• Analyzing ambiguity of context-free grammars

Cited in

(10)

• Pattern selector grammars and several parsing algorithms in the context- free style
• Analyzing Ambiguity of Context-Free Grammars
• scientific article; zbMATH DE number 3896326 (Why is no real title available?)
• scientific article; zbMATH DE number 65744 (Why is no real title available?)
• Context-freeness of parsing expression languages is undecidable
• (0,1)-total pure context-free grammars
• An ambiguity hierarchy of weighted context-free grammars
• Remarks on arbitrary multiple pattern interpretations
• A note on ambiguity in context-free grammars
• Pure 2D picture grammars and languages

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 Q4358451)