  We prove existence of asymptotic entropy of random walks on regular languages
over a finite alphabet and we give formulas for it. Furthermore, we show that
the entropy varies real-analytically in terms of probability measures of
constant support, which describe the random walk. This setting applies, in
particular, to random walks on virtually free groups.
