I'm struggling to understand this question using pumping lemma to prove a language is not regular. Any help would be appreciated.

> *Prove using the Pumping Lemma that the following language is not regular.*
>
>*{0^n^3 |n ≥ 0 is an integer}*

From my understanding a language isn't regular if the power is linear. But I just cant get my head around using the Pumping Lemma to prove this even after reading other examples of Pumping Lemma.

I think most expressions require you to split them into seperate parts, but I just dont understand how this is possible for this expression.



----------------------------