Question 10564 – Theory-of-Computation
February 13, 2024
2013 June UGC NET Paper 1
February 13, 2024
Question 10564 – Theory-of-Computation
February 13, 2024
2013 June UGC NET Paper 1
February 13, 2024

Question 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.
A
R1 ∩ R2 is not regular.
B
R1 ∪ R2 is regular.
C
Σ* − R1 is regular.
D
R1* is not regular.
E
Both (B) and (C).
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x