in Theory of Computation edited by
308 views
0 votes
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 ?
in Theory of Computation edited by
308 views

4 Comments

@jatin  khachane 1

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.

0
0

@jatin khachane 1 1 should be false... what is given in the ans?

0
0
It is given true thts y I posted here :)
0
0

Please log in or register to answer this question.

Related questions