Abstract
For many applications, it is often helpful to assume that CFGs are in one or another special restricted form. Two of the most useful such forms are Chomsky normal form (CNF) and Greibach normal form (GNF).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1977). Normal Forms. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-85706-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85708-9
Online ISBN: 978-3-642-85706-5
eBook Packages: Springer Book Archive