Boundedness testing for unambiguous context-free grammars

DOI10.1016/0020-0190(83)90037-6MaRDI QIDQ594604zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90037-6

zbMATH Keywords

bounded languageleft Szilard languagepolynomial time algorithmunambiguous context-free grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• Ambiguity in context free languages
• Eliminating null rules in linear time
• scientific article; zbMATH DE number 3856428 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• On the equivalence, containment, and covering problems for the regular and context-free languages

This page was built for publication: Boundedness testing for unambiguous context-free grammars

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