Which of the following is false about Deterministic Finite Automata ?

GSET 2021

Which of the following is false about Deterministic Finite Automata ?

  1. A.

    Empty string transitions are not allowed.

  2. B.

    The transition from a state is to a single particular next state.

  3. C.

    It usually requires more states as compared to equivalent Non-Deterministic Finite Automata.

  4. D.

    There cannot be more than one accepting state.

Attempted by 19 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…