No, the language is not regular if . This can be proved using the pumping lemma or the Myhill-Nerode theorem.
Consider . Regular languages are closed under intersection, and the language L' described by the regular expression a*bba* is regular, so if L is regular, then so it . It's easy to show that the latter language is not regular by the pumping lemma.