B3 Vertaisarvioimaton artikkeli konferenssijulkaisussa
Two transitive cellular automata and their strictly temporally periodic points
Tekijät: Jarkko Kari, Kuize Zhang
Toimittaja: Jarkko Kari, Martin Kutrib, Andreas Malcher
Kustannuspaikka: Giessen
Julkaisuvuosi: 2013
Journal: IFIG Research Reports
Kokoomateoksen nimi: Proceedings 19th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2013): Exploratory Papers
Sarjan nimi: IFIG Research report
Aloitussivu: 39
Lopetussivu: 48
Sivujen määrä: 10
Verkko-osoite: http://www.informatik.uni-giessen.de/reports/Report1302.pdf
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali