Which of the following is false about Deterministic Finite Automata ?
GSET 2021
Which of the following is false about Deterministic Finite Automata ?
- A.
Empty string transitions are not allowed.
- B.
The transition from a state is to a single particular next state.
- C.
It usually requires more states as compared to equivalent Non-Deterministic Finite Automata.
- D.
There cannot be more than one accepting state.
Attempted by 19 students.
Sign up free to check your answer
Sign up freeLoading lesson…

