He has covered automata Basics and Deterministic finite automaton (DFA) and Non- deterministic finite automaton (NFA), Equivalence of NFA and DFA – Equivalence of NDFAs with and without €-moves, Minimization of finite automata, Equivalence between two DFA’s in forenoon sessions and Context free grammars and languages Minimization of context free grammars, Normal forms for context free grammars, Chomsky normal form, Greibach normal form in afternoon Session
GUEST LECTURE on “Automata Theory and Compiler Design”
