Lecture 12 _ NFA Part III with solved examples
NFA stands for non-deterministic finite automata. This video is NFA part III. 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. In this lecture NFA is explained in detail with help of multiple solved examples.
#sherurecords