Time Left - 15:00 mins
GATE 2022: Theory Of Computation Quiz-6
Attempt now to get your rank among 288 students!
Which of the following statement is not correct?
The complement of a recursive Language is recursive
If L and are recursively enumerable then L is
Consider the three problems :
Let L1 be a recursive language and L2 be a recursive enumerable language. Then L2 – L1 is?
Which of the following operations is not closed for recursively enumerable languages?
- 288 attempts
- 0 upvotes
- 1 comment
Jul 14GATE & PSU CS