Abstract
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.
Citation
Lorenz A. Gilch. "Asymptotic entropy of random walks on regular languages over a finite alphabet." Electron. J. Probab. 21 1 - 42, 2016. https://doi.org/10.1214/16-EJP4180
Information