Generators (Q1872898)

This paper gives a brief overview of how generators are used to code measure-preserving transformations into symbolic models, and then gives a very short and neat proof of the fact that an ergodic transformation with finite entropy has a finite generator. The proof given here uses the existence of a countable generator and calls on some standard bounds for the lengths of prefix codes in the countable setting.