A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Given the recursively enumerable language (LRE), the context sensitive language (LCS) the recursive language (LREC) the context free language (LCF) and deterministic context free language (LDCF) The relationship between these families is given by
a. LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC
b. LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE
c. LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC
d. LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE
Answer:LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: