Help with the question of Siper chapter 1

Is this language regular?

0 $ ^ k10 ^ k with k geq1 $

It must count the leading and trailing zeros, which is impossible with finite states.