Question 16: Consider the following statements about Deterministic Fi…

Select all that apply.

1. A

   There exist languages that can be accepted by an NFA but not by any DFA.

2. B

   An NFA accepts an input string if at least one computation path reaches an accepting state after reading the entire input.

3. C

   A DFA has exactly one transition for every input symbol from each state.

4. D

   An NFA accepts an input string only if all possible computation paths end in accepting states.

5. E

   Every language accepted by an NFA can also be accepted by a DFA.