DOAJ Open Access 2008

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

Lorenz A. Gilch

Lihat Sumber DOI

Abstrak

We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition probabilities depend only on the last two letters of the current word. Furthermore, we consider also the special case of random walks on free products by amalgamation of finite groups which arise in a natural way from random walks on the single factors. The aim of this paper is to compute several equivalent formulas for the rate of escape with respect to natural length functions for these random walks using different techniques.

Topik & Kata Kunci

Mathematics

Penulis (1)

Lorenz A. Gilch

Format Sitasi

APA MLA BibTeX

Gilch, L.A. (2008). Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups. https://doi.org/10.46298/dmtcs.3580

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3580

Informasi Jurnal

Tahun Terbit: 2008
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3580
Akses: Open Access ✓