Define DFA and NFA.
DFA: A DFA has a
finite set of states and a finite set of input symbols. One state is designated
the star state and zero or more states are accepting states. A transition
function determines how the state changes each time an input symbol is
processed.
NFA: The NFA differs
from the DFA in that the NFA can have any number of transitions (including 0)
to no states from a given state on a given input symbol.
No comments
Dear Members, Thanks for Your Comments. We must be reply your comment answer as soon as possible. Please Stay with us.....