Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Which one of the following exhibits the CORRECT relationship between the language families: LCF (context free languages), LDCF (deterministic context free languages), LRE (recursively enumerable languages), and LREC (recursive languages)?
1
LCF ⊆ LDCF ⊂ LREC ⊂ LRE
2
LDCF ⊂ LCF ⊂ LRE ⊆ LREC
3
LDCF ⊂ LCF ⊂ LREC ⊂ LRE
4
LDCF ⊂ LCF ⊂ LRE = LREC
5
Question Not Attempted