If C is any set of languages, then recall that UC is defined as follows UC...

Transcribed Image Text:

If C is any set of languages, then recall that UC is defined as follows UC = {ss L for some L C}. If C is a set of regular languages, is UC also regular? If you claim that it is, you must prove this. If you claim it is not, then you must provide a counterexample to support your claim. Hint: If C is a finite set, then already know the answer: regular languages are closed under finite union by a theorem we proved in class. Thus, you have to think of the case when C' is an infinite set to answer this question. If C is any set of languages, then recall that UC is defined as follows UC = {ss L for some L C}. If C is a set of regular languages, is UC also regular? If you claim that it is, you must prove this. If you claim it is not, then you must provide a counterexample to support your claim. Hint: If C is a finite set, then already know the answer: regular languages are closed under finite union by a theorem we proved in class. Thus, you have to think of the case when C' is an infinite set to answer this question.