B3 Non-refereed article in a conference publication
Two transitive cellular automata and their strictly temporally periodic points
Authors: Jarkko Kari, Kuize Zhang
Editors: Jarkko Kari, Martin Kutrib, Andreas Malcher
Publishing place: Giessen
Publication year: 2013
Journal: IFIG Research Reports
Book title : Proceedings 19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013): Exploratory Papers
Series title: IFIG Research report
First page : 39
Last page: 48
Number of pages: 10
Web address : http://www.informatik.uni-giessen.de/reports/Report1302.pdf
Abstract
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.
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.