In which of the cases stated below is the following statement true? “For every…

PYQ GATE 1992

In which of the cases stated below is the following statement true? “For every non-deterministic machine M₁, there exists an equivalent deterministic machine M₂ recognizing the same language”.

  1. A.

    M₁ is non-deterministic finite automaton

  2. B.

    M₁ is a non-deterministic PDA

  3. C.

    M₁ is a non-deterministic Turing machine

  4. D.

    For no machine M₁ use the above statement true

Attempted by 36 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…