In which of the cases stated below is the following statement true? “For every…
GATE · 1992 · CS · Question 2 subparts
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”.
- A.
M₁ is non-deterministic finite automaton
- B.
M₁ is a non-deterministic PDA
- C.
M₁ is a non-deterministic Turing machine
- D.
For no machine M₁ use the above statement true
Attempted by 4 students.
Sign up free to check your answer
Sign up freeLoading lesson…