1
GATE CSE 1990
MCQ (More than One Correct Answer)
+2
-0
It is decidable whether:
A
An arbitrary Turing machine halts after 10 steps.
B
A Turing machine prints a specific letter.
C
A Turing machine computes the product of two numbers.
D
None of the above.
2
GATE CSE 1989
MCQ (More than One Correct Answer)
+2
-0
Which of the following problems are un-decidable?
A
Membership problem in context - free languages.
B
Whether a given context - free language is regular.
C
Whether a finite state automation halts on all inputs.
D
Membership problem for type $$0$$ languages.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP