trying to use the pumping lemma

I want to show that L={0^{n^3+3n^2-2n} | n >=0} is not regular.
Here is my proof using the pumping lemma.
Is this correct?
First, observe a few strings in L
0^0,0^2,0^48
Now, assume L is a regular language accepted by some DFA M of s states.
Choose some a^s in L, where |a|>=s. Divide a into a=xyz=00^s0.
Coose x=0, z=0, and y=0^s. Now, for any way of dividing y into three
parts uvw with v not equal to the empty string we already have a
contradiction since for v=0 we have 0^3 which is not in L.


How does that look?
.

Relevant Pages

  • Re: Kook: A New Generation of Scientists Turning Against Evolution
    ... observe the material world around us at all times. ... The String Theory. ... Strings are not observable. ... on strings must make testable predictions. ...
    (talk.origins)
  • Re: Cantors diagonal proof wrong?
    ... You can't observe it. ... how many strings of a give length are texts; ... you could also claim that texts don't exist. ... Unsolicited bulk E-mail subject to legal action. ...
    (sci.math)
  • Re: Create two-dimensional Array from string
    ... array from strings such as ... Let Perl parse it for you. ... Beware eval with unsanitized user inputs like ...
    (comp.lang.perl.misc)
  • Re: infinity
    ... then lets look at the language of strings on ... So when I plug in all the finite L, I get an infinite ... of finite numbers that it leads to a contradiction. ...
    (sci.math)
  • Re: Pumping lemma. Where I go wrong?
    ... you wouldn't get the contradiction you need in below. ... The pumping lemma is stated like this, ... FOR ALL strings in the language ...
    (comp.theory)