Consider the two lists List I and List II given below:
For matching of items in List I with those in List II, which of the following option(s) is/are CORRECT?
View worked solution
Answer: B;C
To find the correct matchings, let us first identify the items in List I and List II:
List I:
(i) Context-free languages (CFL)
(ii) Recursive languages
(iii) Regular languages
List II:
(a) Closed under union
(b) Not closed under complementation
(c) Closed under intersection
Closure Properties Analysis
- Regular Languages: Closed under union, intersection, and complementation.
- Context-free Languages (CFLs): Closed under union, but not closed under intersection or complementation.
- Recursive Languages: Closed under union, intersection, and complementation.
Evaluating the Options
-
Option A:
(i) - (a), (ii) - (b), (iii) - (c)
Incorrect because(ii) - (b)claims Recursive languages are not closed under complementation, which is false. -
Option B:
(i) - (b), (ii) - (a), (iii) - (c)(i) - (b): CFLs are not closed under complementation. (True)(ii) - (a): Recursive languages are closed under union. (True)(iii) - (c): Regular languages are closed under intersection. (True)
-
Option C:
(i) - (b), (ii) - (c), (iii) - (a)(i) - (b): CFLs are not closed under complementation. (True)(ii) - (c): Recursive languages are closed under intersection. (True)(iii) - (a): Regular languages are closed under union. (True)
-
Option D:
(i) - (a), (ii) - (c), (iii) - (b)
Incorrect because(iii) - (b)claims Regular languages are not closed under complementation, which is false.
Free practice · Your answers on this page are not saved.
