Regular Languages
Regex, pumping lemma, closure properties.
Log in to read this chapter
This chapter is part of GATE Computer Science. Log in to continue reading the full lessons, notes and practice.
What you'll learn in this chapter
Pumping lemma
Finite Automata: DFA and NFA
Regular Expressions and Identities
Closure Properties and Pumping Lemma
DFA Minimization and Myhill-Nerode