Yes, you are right. Had they mention C is a** finite **set of regular languages then Union C too would have been regular. Since it is not mentioned, the answer is Union C need not be regular.

Dark Mode

jatin khachane 1
asked
in Theory of Computation
Jan 15, 2019
edited
Jan 15, 2019
by jatin khachane 1

308 views
0 votes

1. If C is any set of regular languages then union C is a regular language

2. Every subset of regular language is regular

3. L = {XYX | X,Y belongs to sigma*} is regular

4. A and B are two Regular languages then A/B {W| W is in A but not in B} is regular

which of the following is true ?

2. Every subset of regular language is regular

3. L = {XYX | X,Y belongs to sigma*} is regular

4. A and B are two Regular languages then A/B {W| W is in A but not in B} is regular

which of the following is true ?