Abstract
This chapter studies fundamental properties of regular languages. Section 4.1 establishes a crucial result — the pumping lemma for regular languages. Typically, this lemma is used to prove that a language is not regular. Section 4.2 studies closure properties of the regular languages. Finally, Section 4.3 discusses some decidable problems concerning these languages.
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
Rights and permissions
Copyright information
© 2000 Springer-Verlag London Limited
About this chapter
Cite this chapter
Meduna, A. (2000). Properties of Regular Languages. In: Automata and Languages. Springer, London. https://doi.org/10.1007/978-1-4471-0501-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0501-5_5
Publisher Name: Springer, London
Print ISBN: 978-1-85233-074-3
Online ISBN: 978-1-4471-0501-5
eBook Packages: Springer Book Archive