An elementary proof of a generalization of double Greibach normal form

DOI10.1016/j.ipl.2009.01.015zbMath1214.68205OpenAlexW1988075105MaRDI QIDQ987803

Ryo Yoshinaka

Publication date: 16 August 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.015

zbMATH Keywords

context-free grammarsformal languagesGreibach normal form

Mathematics Subject Classification ID

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

Related Items (2)

Limited automata and unary languages ⋮ Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet

Cites Work

• On generators and generative capacity of EOL forms
• Position-restricted grammar forms and grammars
• An elementary proof of double Greibach normal form
• Identification in the Limit of k,l-Substitutable Context-Free Languages
• 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
• Unnamed Item
• Unnamed Item

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