Computer Sciences > Gate 2020 > Regular Language
Consider the following statements
I. If L1∪L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite union.
Which of the above statements is/are TRUE ?
I. If L1∪L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite union.
Which of the above statements is/are TRUE ?
Correct : d
Similar Questions
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1′s ?
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1′s ?
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1′s ?
Total Unique Visitors
Loading......