I am back with my lecture notes on Theory of Computer Science. In my previous post Theory of Computer Science Lecture-1 I discussed many topics in brief but here I discuss the NFA Non deterministic finite Automata. Through this lecture you clear your many myths about NFA. 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 of this Series you will get the Lecture on- NFA to DFA Conversion And about Regular Expressions.
DOWNLOAD LINK OF Theory of Computer Science Lecture-2
NOTE:- If any one wants the video lectures on Theory of Computer Science then ping me via contact form and full fill our requirement.
About the Author
Post a Comment