Which one of the following is FALSE?

PYQ GATE 2009

Which one of the following is FALSE?

  1. A.

    There is a unique minimal DFA for every regular language

  2. B.

    Every NFA can be converted to an equivalent PDA

  3. C.

    Complement of every context-free language is recursive

  4. D.

    Every non-deterministic PDA can be converted to an equivalent deterministic PDA

Attempted by 415 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…