Measure evolution of cellular automata and of finitely anticipative transformations

Abstract

The evolution of cellular automata and of finitely anticipative transformations is studied by using right sets. These are the sets of symbols that are compatible with a past of a position and the respective coordinate of the transformation. Our main result shows, under some suitable conditions, that if the entropy converges to zero then the right sets increase towards the whole alphabet. We discuss these concepts with Wolfram automata.