Multiple choice

Which of the following correctly defines the difference between finite automation and non-determistic finite automation?

  1. Q is finite and non-empty set of states in FA and empty set of states in NFA.

  2. δ is from Q X ∑ to 2φ in NFA and Q X ∑ to Q in FA.

  3. ∑ is a finite non empty set of inputs in FA but it is empty set of input in NFA.

  4. q0 is initial state in FA and final state in NFA.

  5. None of the above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Yes, this is the currect difference in FA and NFA.

Keep practicing — related questions