Section outline

  • Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem,
    Finite Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s
    Theorem, Regular and Non-Regular Languages- Closure properties of Regular Languages,
    Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidability- Decision
    properties, Finite Automata and Regular Languages