Partially Permutive Cellular Automata; Analysis via Tilings Subalphabets

摘要

One dimensional cellular automata are analyzed via their generalized permutivity.Subalphabets/tilings enable one to identify Bernoulli factors but the main focus is in the non-surjective case where complex interaction phenomena arise. In particular the interaction of subalphabets can generate random walks as well as their degenerate forms. A comprehensive scheme emerges that unifies the analysis of the class of partially permutive cellular automata.