CS304 : Formal Languages and Automata Theory
Introduction
Deterministic Finite Automata
Non-Deterministic Finite Automata
Equivalence of DFA and NFA
Pumping Lemma for regular languages
Minimisation of DFA
Myhill-Nerode Theorem
Minimisation of DFA 2
Context Free Grammar
CFG and Regular Language
Pumping lemma for CFG
Simplification of CFG
Removal of Unit Productions
Proof of Pumping Lemma
Closure properties of CFL
Mid Sem Exam
Decision problems of CFG
End Sem
