M

Mr. Dubey • 87.94K Points
Coach

Q. In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”

(A) m1 is a non-deterministic finite automata
(B) m1 is a non-deterministic push-down automata
(C) m1 is a non-deterministic turing machine
(D) for no machine m1 use the above statement true
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.


Question analytics