Abstract
In this chapter we introduce some basic notions and some notations we will use in the book. In particular, we introduce the notions of a free monoid, a formal grammar and its generated language, the Chomsky hierarchy, the Kuroda normal form, the Chomsky normal form, and the Greibach normal form. We also examine the effects of the presence of the epsilon production in formal grammars. Finally, we study the derivations in context-free languages and the notions of a substitution and a homomorphism.
This is a preview of subscription content, log in via an institution to check access.
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
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Pettorossi, A. (2022). Formal Grammars and Languages. In: Automata Theory and Formal Languages. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-11965-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-11965-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-11964-4
Online ISBN: 978-3-031-11965-1
eBook Packages: Computer ScienceComputer Science (R0)