> *Finite Automata (FA)

> *Deterministic Finite Automata (DFA)

> *Non-deterministic Finite Automata (NFA)

> *NFA with epsilon transitions – NFA without epsilon transition,

> *Conversion of NFA to DFA

> Equivalence of NFA and DFA

> *Minimization of DFA

> *Regular Expression

> **FA and Regular Expressions: FA to regular expression and regular                 expression to FA

> Regular grammar and FA

> *Pumping lemma for regular languages 

> *Closure properties of regular languages

> *Context-Free Grammar (CFG) – Derivations

> Parse Trees

> *CYK algorithm – Simplification of CFG

> Unit productions, Null productions

> *Normal forms for CFG: CNF and GNF.

> *Pumping Lemma for CFL

> *Closure Properties of CFL