THEORY OF COMPUTATION TOC GATE CS PYQ 2022
ฝัง
- เผยแพร่เมื่อ 5 ก.พ. 2025
- GATE CS 2022
THEORY OF COMPUTATION PYQ
Which of the following is/are undecidable?
(A)Given two Turing machines M1 and M2 decide if L(M1)=L(M2).
(B)Given a Turing machine M, decide if L(M) is regular.
(C)Given a Turing machine M , decide if M accepts all strings.
(D)Given a Turing machine M, decide if M takes more than 1073 steps on every string.
