The p-adic languages provide an example of a stochastic language that is not regular, and also show that the number of stochastic languages is uncountable.
L_{\eta}(p)=\{0.n_1n_2n_3 \ldots \vert 0\le n_k \eta \} .