Consider the language L $=\{03$n $|$ n $>=0\}$ over $\backslash$Sigma $=\{0\}.$ In other words, L contains

strings which have a multiple of $3$ number of $0$s$.($e$.$g$.\backslash$epsi $,000,000000,000000000,...$