scientific article; zbMATH DE number 1067868

zbMATH Open0881.68076MaRDI QIDQ4358451FDOQ4358451

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

Publication date: 29 September 1997

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

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

zbMATH Keywords

ambiguitycryptosystemspure context-free grammars

Mathematics Subject Classification ID

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

Cited In (10)

• Context-freeness of parsing expression languages is undecidable
• Pure 2D picture grammars and languages
• Remarks on arbitrary multiple pattern interpretations
• Title not available (Why is that?)
• Pattern selector grammars and several parsing algorithms in the context- free style
• Title not available (Why is that?)
• A note on ambiguity in context-free grammars
• Analyzing Ambiguity of Context-Free Grammars
• An ambiguity hierarchy of weighted context-free grammars
• \((0,1)\)-total pure context-free grammars

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)