I'm here with the third lecture on Theory of Computer Science or Automata Theory series. Previously I published two lectures in this series Theory of Computer Science Lecture-1 and Theory of Computer Science Lecture-2 . In previous lecture I discuss many things like DFA, NFA etc. So, in this lecture I discuss about NFA to DFA conversion and Regular Expression. So, here I give you the direct Download link of this Lecture feel free to ask any question about it, via commenting below post.
In my Next post on this Series you will get the Lecture Notes on-Text Search and Closure properties.
NOTE:- If any one wants the video lectures on Theory of Computer Science then ping me via contact form and full fill our requirement.