Given the recursively enumerable language (LRE), the context sensitive…

PYQ UGC NET 2014

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

  1. A.

    LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC

  2. B.

    LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE

  3. C.

    LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC

  4. D.

    LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE

Attempted by 162 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…