More on the power of chain rules in context-free grammars

DOI10.1016/0304-3975(82)90122-0zbMATH Open0553.68043OpenAlexW2071991779MaRDI QIDQ759487FDOQ759487

Authors: Norbert Blum 

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90122-0

Recommendations

• Lower bounds for context-free grammars
• On the context-free production complexity of finite languages
• Greibach normal form transformation revisited.
• Polynomial size test sets for context-free languages
• Derivational complexity of context-free grammars

zbMATH Keywords

context-free languagesize reduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Graphs that do not Contain a Thomsen Graph
• On the power of chain rules in context free grammars

Cited In (3)

• Title not available (Why is that?)
• Greibach normal form transformation, revisited
• Lower bounds for context-free grammars

This page was built for publication: More on the power of chain rules in context-free grammars

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