In this talk, I will collect some results about random walks on regular languages over a finite alphabet. For this purpose, I will give a brief introduction to random walks on regular languages. Afterwards I will present some results about the rate of escape and the asymptotic entropy of these random walks: I will sketch the proofs for existence of the rate of escape and the entropy (including formulas). The main idea is to cut the random walk into pieces such that this sequence of pieces form a Markov chain. Finally, I will summarize some important properties.