Open In App

GATE | GATE MOCK 2017 | Question 54

Like Article
Like
Save
Share
Report

Suppose M1 and M2 are two TM’s such that L(M1) = L(M2). Then

(A) On every input on which M1 doesn’t halt, M2 doesn’t halt too.

(B) On every i/p on which M1 halts, M2 halts too.

(C) On every i/p which M1 accepts, M2 halts.

(D) None of above.


Answer: (C)

Explanation:

M2 accepts strings in L(M1) so definitely it will halt. Other 2 are not guaranteed as Turing machine M does not accept w if it either rejects w by halting to a reject state or loops infinitely on w.


Quiz of this Question


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads