An elementary proof of a generalization of double Greibach normal form

DOI10.1016/J.IPL.2009.01.015zbMATH Open1214.68205OpenAlexW1988075105MaRDI QIDQ987803FDOQ987803

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)

Cites Work

• Title not available (Why is that?)
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Title not available (Why is that?)
• An elementary proof of double Greibach normal form
• Position-restricted grammar forms and grammars
• On generators and generative capacity of EOL forms
• Matrix Equations and Normal Forms for Context-Free Grammars
• Identification in the Limit of k,l-Substitutable Context-Free Languages
• On Greibach normal form construction

Cited In (2)

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

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

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