期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2012
卷号：90
页码：225-235
DOI：10.4204/EPTCS.90.18
出版社：Open Publishing Association
摘要：We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for almost equicontinuous surjective cellular automata while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive.
