Random Stationary Processes

Abstract

Given a finite alphabet, there is an inductive method for constructing a stationary measure on doubly infinite words from this alphabet. This construction can be randomized; the main focus here is on a particular uniform randomization which intuitively corresponds to the idea of choosing a generic stationary process. It is shown that with probability 1, the random stationary process has zero entropy and gives positive probability to every periodic infinite word.