Language which contains exactly one 0.
Is this a regular language?
Yes. You can easily draw fda for it. And it's regular expression will be 1*01*
So this is a regular language which does not contain empty string.
This is an example which shows that if a language is regular than it is not necessary that it contains empty string.