Prevalence and structure of adding machines for cellular automata

Consider the collection of left permutive cellular automata Φ with no memory, defined on the space S of all doubly infinite sequences from a finite alphabet. There exists , a dense subset of S, such that is topologically conjugate to an odometer for all so long as Φm is not the identity map for any m. Moreover, Φ generates the same odometer for all . The set is a dense Gδ subset with full measure of a particular subspace of S.