Pumping Lemma for Regular Languages for a language that includes a constant

Question

If I have a language like this:

L1 = {a^128 b^na^n | n >= 0}

and I have to prove it is not regular, is it enough to prove b^na^n is not regular, thus the whole expression is not regular, since a^128 is finite?

Answer 1

是的，因为常规语言在左右商数下是封闭的，而有限语言是常规语言。