CS402 GDB Solution

FA approach is better than NFA. Because the FA contains the finite set of transition i.e. for each state and for each input letter there is a transition showing how to move from one state to another. But in NFA that contains Finite set of transition , showing where to move if a letter is input at certain state, there is many transition for certain letters and there may not be any certain transition for certain letters. Therefore, I think that FA is better approach than the NFA for understanding.

NFA can be an intermediate structure between FA and TG. And NFA is converted into FA. Following are the examples of the FA and NFA.