Context-free languages and random walks on groups (Q1098476): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90167-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992097918 / rank | |||
Normal rank | |||
Latest revision as of 11:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Context-free languages and random walks on groups |
scientific article |
Statements
Context-free languages and random walks on groups (English)
0 references
1987
0 references
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.
0 references
Green function
0 references
random walk on a discrete group
0 references
context-free word problem
0 references
formal language theory
0 references
