self doubt

Question

1. union of all finite subsets of regular language is regular.
2. at least one proper infinite subset(if exists) of infinite CFL is regular.

which is true??

Comments

yes, the 2nd statement is false

---

@joshi_nitish, 

What will be the answer if we have "Union of all infinite subsets of regular language"?

---

@Hemant

"Union of all infinite subsets of regular language" 

due to word all, every possible string of L will be present in newly created set ($\bigcup_{i=1}^{n}$Li) and also no outsider string(which is not present in L) will be present in newly created set ($\bigcup_{i=1}^{n}$Li)

therefore finally union of all infinite subsets of regular language L is nothing but L