Does a language have a regular expression if and only if it is regular? I know that if a language has a regular expression it is regular, is the other way also true?
Yes, a language can be described as a (pure vanilla) regular expression if and only if it is regular. You can see the proof in any decent textbook on formal languages.