Minimization of context-free grammars

DOI10.17223/20710410/45/10MaRDI QIDQ5151280zbMATH OpenOpenAlexFDO

Authors Yu. D. Ryazanov, S. V. Nazina

Publication date 17 February 2021

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm675

zbMATH Keywords

equivalence relationformal grammarformal languageminimization

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2201369
• Simplification of context-free grammar through Petri net
• scientific article; zbMATH DE number 637403
• scientific article; zbMATH DE number 3940755
• On Greibach normal form construction

Cites work

• Automaton model of visual description of syntax parsing
• scientific article; zbMATH DE number 5344975 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)

Cited in

(7)

• Grammar flow analysis reduction to scheduling problem
• Finding the smallest binarization of a CFG is NP-hard
• Minimalist Grammar Transition-Based Parsing
• scientific article; zbMATH DE number 3940755 (Why is no real title available?)
• Simplification of context-free grammar through Petri net
• scientific article; zbMATH DE number 1560210 (Why is no real title available?)
• Die Grösse des Minimalen Analysators Einer Kontextfreien Grammatik

This page was built for publication: Minimization of context-free grammars

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