• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC-NET | UGC NET CS 2014 Dec - III | Question 61

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)

L CF ⊆ L DCF ⊆ LCS ⊆ LRE ⊆ LREC

(B)

L CF ⊆ L DCF ⊆ LCS ⊆ LREC ⊆ LRE

(C)

L DCF ⊆ L CF ⊆ LCS ⊆ LRE ⊆ LREC

(D)

L DCF ⊆ L CF ⊆ LCS ⊆ LREC ⊆ LRE

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments