GATE Computer Science (CS) 2022 Shift 1 Solved Paper

© examsiri.com

Question : 45 of 65

Marks: +1, -0

Which of the following is/are undecidable?

Given two Turing machines M1 and M2 decide if L(M1) = L(M2).
Given a Turing machine M , decide if L M( ) is regular.
Given a Turing machine M , decide if M accepts all strings.
Given a Turing machine M , decide if M takes more than 1073 steps on every string.

Go to Question:

Prev Question

Next Question