DYNAMICAL BEHAVIOR OF COVENS APERIODIC CELLULAR-AUTOMATA

Citation
F. Blanchard et A. Maass, DYNAMICAL BEHAVIOR OF COVENS APERIODIC CELLULAR-AUTOMATA, Theoretical computer science, 163(1-2), 1996, pp. 291-302
Citations number
9
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
ISSN journal
03043975
Volume
163
Issue
1-2
Year of publication
1996
Pages
291 - 302
Database
ISI
SICI code
0304-3975(1996)163:1-2<291:DBOCAC>2.0.ZU;2-I
Abstract
We show that the aperiodic cellular automata studied by Coven (1980), that is the maps F: {0, 1}(Z) --> {0, 1}(Z) induced by block maps f: { 0, 1}(r+1) --> {0, 1} such that f(x(0),x(1),...,x(r)) is equal to (x(0 ) + 1) mod 2 if x(1)...x(r) = b(1)...b(r) and equal to x(0) otherwise, where B = b(1)...b(r) is a given aperiodic word, have the following p osition in classification of Kurka (1994): they are regular, contain e quicontinuous points without being equicontinuous, and are chain trans itive but not topologically transitive. Therefore they do not have the shadowing property; this answers in the negative a question raised by P. Kurka.