Please tell me the explanation for each choice?
Question 3
2 / 2 pts
The following is a list of statements regarding finite automata. Select all
statements that are true.
A NFA can recognize 00 such that n > 0, but a DFA cannot.
Correct!
One can build a DFA to recognize {1300 o100 U 0400 13000}.
While processing an input string, a NFA will accept this string as soon as it reaches an accepting state.
One can always convert a NFA with n states to an equivalent DFA with 2n states.