Lecture 11_ NFA Part II with examples (urdu/hindi)
NFA stands for non-deterministic finite automata. This video is NFA part II. The finite automata are called NFA when there exist many paths for specific input from the current state to the next state. The exact state to which the machine moves cannot be determined. In NFA empty state transition is also allowed. In this lecture NFA with empty state is explained in details. In this lecture NFA is explained in detail with help of solved examples.
#sherurecords