Topological Conjugacies Between Cellular Automata

• Main Author: Epperlein, Jeremias
• Other Authors: Technische Universität Dresden, Fakultät Mathematik und Naturwissenschaften
• Format: Doctoral Thesis
• Language: English
• Published: Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden 2017
• Subjects: Zelluläre Automaten; Topologische Konjugation; Ableitungsalgebra; Dynamische Systeme; Entropie; Symbolische Dynamik; cellular automata; topogical conjugacy; derivative algebra; dynamical systems; entropy; subshifts; symbolic dynamics; ddc:510; rvk:SK 950; rvk:ST 136; Dynamisches System; Zellularer Automat
• Online Access: http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-231823; http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-231823; http://www.qucosa.de/fileadmin/data/qucosa/documents/23182/dissertation-pdfa.pdf

We study cellular automata as discrete dynamical systems and in particular investigate under which conditions two cellular automata are topologically conjugate. Based on work of McKinsey, Tarski, Pierce and Head we introduce derivative algebras to study the topological structure of sofic shifts in dimension one. This allows us to classify periodic cellular automata on sofic shifts up to topological conjugacy based on the structure of their periodic points. We also get new conjugacy invariants in the general case. Based on a construction by Hanf and Halmos, we construct a pair of non-homeomorphic subshifts whose disjoint sums with themselves are homeomorphic. From this we can construct two cellular automata on homeomorphic state spaces for which all points have minimal period two, which are, however, not topologically conjugate. We apply our methods to classify the 256 elementary cellular automata with radius one over the binary alphabet up to topological conjugacy. By means of linear algebra over the field with two elements and identities between Fibonacci-polynomials we show that every conjugacy between rule 90 and rule 150 cannot have only a finite number of local rules. Finally, we look at the sequences of finite dynamical systems obtained by restricting cellular automata to spatially periodic points. If these sequences are termwise conjugate, we call the cellular automata conjugate on all tori. We then study the invariants under this notion of isomorphism. By means of an appropriately defined entropy, we can show that surjectivity is such an invariant.