On Greibach normal form construction

DOI10.1016/0304-3975(85)90173-2zbMath0606.68073OpenAlexW4213005790MaRDI QIDQ5903291

Friedrich J. Urbanek

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90173-2

zbMATH Keywords

context-free grammarChomsky normal formGreibach normal formpure derivation-oriented reasoning

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Language equivalence of probabilistic pushdown automata ⋮ An elementary proof of double Greibach normal form ⋮ An elementary proof of a generalization of double Greibach normal form ⋮ On Greibach normal form construction ⋮ Double Greibach operator grammars ⋮ Greibach normal form transformation revisited.

Cites Work

• Matrix Equations and Normal Forms for Context-Free Grammars
• Unnamed Item

This page was built for publication: On Greibach normal form construction