Context-free languages and random walks on groups
The Green function of an arbitrary, finitely supported random walk on a discrete group with context-free word problem is algebraic. It is shown how this theorem can be deduced from basic results of formal language theory. Context-free groups are precisely the finite extensions of free groups.
scientific article; zbMATH DE number 4038890
scientific article