GATE 1990
February 13, 20242013 June UGC NET Paper 1
February 13, 2024Question 10565 – Theory-of-Computation
Choose the correct alternatives (More than one may be correct).
Let R1 and R2 be regular sets defined over the alphabet Σ Then:
Correct Answer: E
Question 33 Explanation:
Regular languages are closed under,
1) Intersection
2) Union
3) Complement
4) Kleen-closure
Σ* – R1 is the complement of R1.
Hence, (B) and (C) are true.
1) Intersection
2) Union
3) Complement
4) Kleen-closure
Σ* – R1 is the complement of R1.
Hence, (B) and (C) are true.
R1 ∩ R2 is not regular.
R1 ∪ R2 is regular.
Σ* − R1 is regular.
R1* is not regular.
Both (B) and (C).