An easy proof of Greibach normal form

DOI10.1016/S0019-9958(84)80013-3MaRDI QIDQ3718172zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(84)80013-3

zbMATH Keywords

algorithmcontext-free grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Greibach normal form construction
• Greibach normal form transformation revisited.
• Greibach normal form transformation, revisited
• An elementary proof of double Greibach normal form
• Complexity of normal form grammars

Cited in

(8)

• An elementary proof of double Greibach normal form
• Greibach normal form transformation revisited.
• The normal form of lattice-valued context free grammars
• scientific article; zbMATH DE number 4135415 (Why is no real title available?)
• Greibach normal form transformation, revisited
• On Greibach normal form construction
• Normal form algorithms for extended context-free grammars
• On Greibach normal form construction

This page was built for publication: An easy proof of Greibach normal form

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