An elementary proof of double Greibach normal form

DOI10.1016/0020-0190(92)90101-ZzbMath0796.68133OpenAlexW1977914976MaRDI QIDQ1209361

Joost Engelfriet

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90101-z

zbMATH Keywords

context-free grammarsGreibach normal form

Mathematics Subject Classification ID

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

Related Items (7)

A pumping lemma for flip-pushdown languages ⋮ Identification in the Limit of k,l-Substitutable Context-Free Languages ⋮ Quasi-rocking real-time pushdown automata ⋮ An elementary proof of a generalization of double Greibach normal form ⋮ Limited automata and unary languages ⋮ Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet ⋮ Double Greibach operator grammars

Cites Work

• Context-free graph languages of bounded degree are generated by apex graph grammars
• An easy proof of Greibach normal form
• A Greibach normal form for context-free graph grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Matrix Equations and Normal Forms for Context-Free Grammars
• On Greibach normal form construction
• On Greibach normal form construction

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