Match List-I with List-II:
Where L1: Regular language
L2: Context-free language
L3: Recursive language
L4: Recursively enumerable language
|
List-1 |
List-2 |
|
(a) L'3 U L4 |
(i) Context-free language |
|
(b) L'2 U L3 |
(ii) Recursively enumerable language |
|
(c) L1* ∩ L2 |
(iii) Recursive language |
Choose the correct from those given below:
1
(a)-(ii); (b)-(i); (c)-(iii)
2
(a)-(ii); (b)-(iii); (c)-(i)
3
(a)-(iii); (b)-(i); (c)-(ii)
4
(a)-(i); (b)-(ii); (c)-(iii)