About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Periodic points for onto cellular automata
Abstract
Let φ be a one-dimensional surjective cellular automaton map. We prove that if φ is a closing map, then the configurations which are both spatially and temporally periodic are dense. (If φ is not a closing map, then we do not know whether the temporally periodic configurations must be dense.) The results are special cases of results for shifts of finite type, and the proofs use symbolic dynamical techniques.