Time Left - 15:00 mins

GATE 2024 theory of computation Rank Booster Quiz 13

Attempt now to get your rank among 44 students!

Question 1

Recursively enumerable language (problem) is ___________

Question 2

Pumping lemma is generally used for proving :

Question 3

Recursive language is not closed under which operation?

Question 4

If L and

are recursively enumerable then L is

Question 5

Which of the following functions are computable by turing machine?

Question 6

Consider the following statements about a TM that accepts a language L.

S1: If the string in the language L, then TM halts in final state.

S2: If the string not in the language L, then TM may halt in non-final state or never halt.

If the string given as an input to the TM, then which of the above statements are correct?

Question 7

Consider the following statements about L:

1) L is accepted by multi-tape Turing machine, M1

2) L is also accepted by a single tape Turing Machine, M2

Then which of the following is correct?

Tags :

Nov 22GATE & PSU CS