How is there fewer zeros in the left of 1 in this language?

27 Views Asked by At

From Hopcroft's Introduction to Automata Theory, Languages, and Computations, 3ed, chapter 5 p. 172:

pal

I don't quite get how can there be fewer 0's in the left of 1 if we have w = 0^n*1*0^n?