GATE | GATE MOCK 2017 | Question 54

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

Article Tags :

GATE

GATE 2017 Mock

GATE-GATE 2017 Mock

Recommended Articles

1. GATE | GATE MOCK 2017 | Question 1

2. GATE | GATE MOCK 2017 | Question 2

3. GATE | GATE MOCK 2017 | Question 3

4. GATE | GATE MOCK 2017 | Question 4

5. GATE | GATE MOCK 2017 | Question 5

6. GATE | GATE MOCK 2017 | Question 6

7. GATE | GATE MOCK 2017 | Question 7

8. GATE | GATE MOCK 2017 | Question 8

9. GATE | GATE MOCK 2017 | Question 9

10. GATE | GATE MOCK 2017 | Question 10

11. GATE | GATE MOCK 2017 | Question 11

12. GATE | GATE MOCK 2017 | Question 12

13. GATE | GATE MOCK 2017 | Question 13

14. GATE | GATE MOCK 2017 | Question 14

15. GATE | GATE MOCK 2017 | Question 15

16. GATE | GATE MOCK 2017 | Question 16

17. GATE | GATE MOCK 2017 | Question 17

18. GATE | GATE MOCK 2017 | Question 18

19. GATE | GATE MOCK 2017 | Question 19

20. GATE | GATE MOCK 2017 | Question 20

21. GATE | GATE MOCK 2017 | Question 21

22. GATE | GATE MOCK 2017 | Question 22

23. GATE | GATE MOCK 2017 | Question 23

24. GATE | GATE MOCK 2017 | Question 24

25. GATE | GATE MOCK 2017 | Question 25