Two transitive cellular automata and their strictly temporally periodic points

: Jarkko Kari, Kuize Zhang

: Jarkko Kari, Martin Kutrib, Andreas Malcher

: Giessen

: 2013

: IFIG Research Reports

: Proceedings 19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013): Exploratory Papers

: IFIG Research report

: 39

: 48

: 10

: http://www.informatik.uni-giessen.de/reports/Report1302.pdf

In this paper, we give two one-dimensional, reversible and mixing cellular automata whose sets of strictly temporally periodic (STP) points are (i) neither dense nor empty, and (ii) dense, respectively. The first example answers two questions proposed in AUTOMATA 2012: there are surjective cellular automata whose STP points are neither dense nor empty, and there are Devaney-chaotic cellular automata with STP points.

Computer and information sciences
Mathematics