##### regular language

Let L⊆{0,1}^{∗}. Which of the following is true?

- If L is regular, all subsets of L are regular.
- If all proper subsets of L are regular, then L is regular.
- If all finite subsets of L are regular, then L is regular.
- If a proper subset of L is not regular, then L is not regular.

If all finite subsets of L are regular, then L is regular. // true

but the statement regular language has got its finite subset as regular is not true.

You can analyse these statements by taking examples.