Time Left - 15:00 mins

GATE 2022: Theory Of Computation Quiz-6

Attempt now to get your rank among 288 students!

Question 1

Which of the following statement is not correct?

Question 2

The complement of a recursive Language is recursive

Question 3

If L and are recursively enumerable then L is

Question 4

Consider the three problems :
• Equivalence
• Ambiguity
• Regularity

Question 5

Let L1 be a recursive language and L2 be a recursive enumerable language. Then L2 – L1 is?

Question 6

Which of the following operations is not closed for recursively enumerable languages?
  • 288 attempts
  • 0 upvotes
  • 1 comment
Jul 14GATE & PSU CS