edited by
491 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 ?
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
aambazinga asked Jan 8, 2019
1,167 views
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring }number of states in the minimal DFA of L’ is?i’m getting 3. please confirm if you are ...
0 votes
0 votes
0 answers
4
Prince Sindhiya asked Jan 11, 2019
370 views
How to do these type questions step by stepplease help