Theory of Computation
Quick practice
Question 1 of 5
Consider 2 languages L1 and L2, both of which are Turing-Decidable. Which of the following will be true for 
?
A
It will be recursive enumerable but not recursive
B
None
C
It will be recursive
D
It will be regular language
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go