Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Match List I with List II:
LR: Regular language, LCF: Context free language
LREC: Recursive language, LRE: Recursively enumerable language.
|
List I |
List II |
|
(A) Recursively Enumerable language |
(I) L̅REC ∪ LRE |
|
(B) Recursive language |
(II) L̅CF ∪ LREC |
|
(C) Context Free language |
(III) LR ∩ LCF |
Choose the correct answer from the options given below:
1
A - II, B - III, C - I
2
A - III, B - I, C - II
3
A - I, B - II, C - III
4
A - II, B - I, C - III