Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups

@inproceedings{Gilch2008RateOE,
  title={Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups},
  author={Lorenz A. Gilch},
  year={2008}
}
We consider random walks on the set of all words over a finite al phabet such that in each step only the last two letters of the current word may be modified and only one letter may be ad joined or deleted. We assume that the transition probabilities depend only on the last two letters of the curr ent word. Furthermore, we consider also the special case of random walks on free products by amalgamation of finite group s which arise in a natural way from random walks on the single factors. The… CONTINUE READING

Similar Papers

Loading similar papers…