Measurable events indexed by words

Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros

For every integer $k\ge 2$ let $[k{]}^{<\mathbb{N}}$ be the set of all words over $k$, that is, all finite sequences having values in $[k]:=\{1,...,k\}$. A Carlson-Simpson tree of $…