Difference between dfa and nfa in automata
Answers
Answered by
0
DFA is a Deterministic Finite Automaton. Deterministic means that it can only be in, and transition to, one state at a time (i.e. for some given input). The major important difference is that an NFA is usually much more efficient. For Every symbol of the alphabet, there is only one state transition in DFA .
Answered by
0
See following image:
Attachments:
Similar questions
Math,
7 months ago
Math,
7 months ago
Social Sciences,
7 months ago
Physics,
1 year ago
English,
1 year ago